Sciweavers

82 search results - page 9 / 17
» Partition Based Path Join Algorithms for XML Data
Sort
View
PVLDB
2010
123views more  PVLDB 2010»
13 years 6 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...
SIGMOD
2011
ACM
248views Database» more  SIGMOD 2011»
12 years 10 months ago
Llama: leveraging columnar storage for scalable join processing in the MapReduce framework
To achieve high reliability and scalability, most large-scale data warehouse systems have adopted the cluster-based architecture. In this paper, we propose the design of a new clu...
Yuting Lin, Divyakant Agrawal, Chun Chen, Beng Chi...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
ICDT
1999
ACM
97views Database» more  ICDT 1999»
14 years 5 days ago
Optimizing Large Join Queries in Mediation Systems
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector...
VLDB
2002
ACM
116views Database» more  VLDB 2002»
13 years 7 months ago
Updates for Structure Indexes
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...