Sciweavers

2092 search results - page 257 / 419
» Dynamically Distributed Query Evaluation
Sort
View
136
Voted
CIKM
2007
Springer
15 years 10 months ago
Effective top-k computation in retrieving structured documents with term-proximity support
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen
156
Voted
ICDT
2010
ACM
211views Database» more  ICDT 2010»
16 years 1 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
15 years 10 months ago
CoTS: A Scalable Framework for Parallelizing Frequency Counting over Data Streams
Applications involving analysis of data streams have gained significant popularity and importance. Frequency counting, frequent elements and top-k queries form a class of operato...
Sudipto Das, Shyam Antony, Divyakant Agrawal, Amr ...
CIKM
2007
Springer
15 years 10 months ago
Generalizing from relevance feedback using named entity wildcards
Traditional adaptive filtering systems learn the user’s interests in a rather simple way – words from relevant documents are favored in the query model, while words from irre...
Abhimanyu Lad, Yiming Yang
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
15 years 8 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...