Sciweavers

353 search results - page 8 / 71
» Processing Top-k Join Queries
Sort
View
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
15 years 7 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
PVLDB
2010
84views more  PVLDB 2010»
13 years 6 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
14 years 2 months ago
Secure Mediation of Join Queries by Processing Ciphertexts
In a secure mediated information system, confidentiality is one of the main concerns when transmitting data from datasources to clients via a mediator. We present three approache...
Joachim Biskup, Christian Tsatedem, Lena Wiese
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 1 months ago
Revisiting Pipelined Parallelism in Multi-Join Query Processing
Multi-join queries are the core of any integration service that integrates data from multiple distributed data sources. Due to the large number of data sources and possibly high v...
Bin Liu, Elke A. Rundensteiner
VLDB
2008
ACM
76views Database» more  VLDB 2008»
14 years 8 months ago
Query processing of multi-way stream window joins
Moustafa A. Hammad, Walid G. Aref, Ahmed K. Elmaga...