Sciweavers

72 search results - page 1 / 15
» Approximate distributed top- k queries
Sort
View
114
Voted
DC
2008
14 years 10 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
16 years 2 days ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
185
Voted
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
16 years 2 days ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
SIGMOD
2003
ACM
209views Database» more  SIGMOD 2003»
15 years 11 months ago
Distributed Top-K Monitoring
The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumenta...
Brian Babcock, Chris Olston
CIKM
2011
Springer
13 years 10 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...