Sciweavers

16 search results - page 2 / 4
» TopX: efficient and versatile top- k query processing for se...
Sort
View
WWW
2006
ACM
14 years 5 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing
WWW
2006
ACM
14 years 5 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
14 years 5 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
ADC
2009
Springer
145views Database» more  ADC 2009»
13 years 8 months ago
Efficient XQuery Join Processing in Publish/Subscribe Systems
Efficient XML filtering has been a fundamental technique in recent Web service and XML publish/subscribe applications. In this paper, we consider the problem of filtering a contin...
Ryan H. Choi, Raymond K. Wong
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 8 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...