Sciweavers

486 search results - page 41 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
EDBT
2008
ACM
129views Database» more  EDBT 2008»
16 years 1 months ago
Continuous multi-way joins over distributed hash tables
This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that...
Stratos Idreos, Erietta Liarou, Manolis Koubarakis
SIGMOD
1999
ACM
87views Database» more  SIGMOD 1999»
15 years 5 months ago
On Random Sampling over Joins
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasa...
CIKM
2007
Springer
15 years 7 months ago
Ix-cubes: iceberg cubes for data warehousing and olap on xml data
With increasing amount of data being stored in XML format, OLAP queries over these data become important. OLAP queries have been well studied in the relational database systems. H...
Fianny Ming-fei Jiang, Jian Pei, Ada Wai-Chee Fu
ICDE
2012
IEEE
304views Database» more  ICDE 2012»
13 years 4 months ago
Learning-based Query Performance Modeling and Prediction
— Accurate query performance prediction (QPP) is central to effective resource management, query optimization and query scheduling. Analytical cost models, used in current genera...
Mert Akdere, Ugur Çetintemel, Matteo Rionda...
VLDB
2001
ACM
80views Database» more  VLDB 2001»
15 years 6 months ago
Views in a Large Scale XML Repository
We are interested in de ning and querying views in a huge and highly heterogeneous XML repository Web scale. In this context, view de nitions are very large and there is no appa...
Sophie Cluet, Pierangelo Veltri, Dan Vodislav