Sciweavers

2608 search results - page 489 / 522
» Inferring Answers to Queries
Sort
View
COMPGEOM
2010
ACM
15 years 7 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 7 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
VLDB
1999
ACM
145views Database» more  VLDB 1999»
15 years 6 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
VLDB
1999
ACM
140views Database» more  VLDB 1999»
15 years 6 months ago
Distributed Hypertext Resource Discovery Through Examples
We describe the architecture of a hypertext resource discovery system using a relational database. Such a system can answer questions that combine page contents, metadata, and hyp...
Soumen Chakrabarti, Martin van den Berg, Byron Dom
SIGIR
2010
ACM
15 years 5 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...