Sciweavers

353 search results - page 43 / 71
» Processing Top-k Join Queries
Sort
View
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 8 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
P2P
2006
IEEE
229views Communications» more  P2P 2006»
14 years 1 months ago
Cost-Aware Processing of Similarity Queries in Structured Overlays
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
IJCIS
1998
116views more  IJCIS 1998»
13 years 7 months ago
Distributed Query Scheduling Service: An Architecture and Its Implementation
We present the systematic design and development of a distributed query scheduling service DQS in the context of DIOM, a distributed and interoperable query mediation system 26 ...
Ling Liu, Calton Pu, Kirill Richine
BNCOD
2011
356views Database» more  BNCOD 2011»
12 years 7 months ago
Achieving High Freshness and Optimal Throughput in CPU-Limited Execution of Multi-join Continuous Queries
Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams - resul...
Abhishek Mukherji, Elke A. Rundensteiner, Matthew ...