Sciweavers

491 search results - page 52 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
SAC
2009
ACM
14 years 2 months ago
Enhancing XML data warehouse query performance by fragmentation
XML data warehouses form an interesting basis for decisionsupport applications that exploit heterogeneous data from multiple sources. However, XML-native database systems currentl...
Hadj Mahboubi, Jérôme Darmont
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
FGCS
2006
113views more  FGCS 2006»
13 years 7 months ago
Performance feature identification by comparative trace analysis
This work introduces a method for instrumenting applications, producing execution traces, and visualizing multiple trace instances to identify performance features. The approach p...
Daniel P. Spooner, Darren J. Kerbyson
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 9 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....