Sciweavers

1160 search results - page 177 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
JIIS
2006
76views more  JIIS 2006»
14 years 10 months ago
Holes in joins
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
Jarek Gryz, Dongming Liang
VLDB
1995
ACM
129views Database» more  VLDB 1995»
15 years 1 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
EDBT
2004
ACM
131views Database» more  EDBT 2004»
15 years 10 months ago
Declustering Two-Dimensional Datasets over MEMS-Based Storage
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
Hailing Yu, Divyakant Agrawal, Amr El Abbadi
DOLAP
2003
ACM
15 years 3 months ago
Spatial hierarchy and OLAP-favored search in spatial data warehouse
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
Fangyan Rao, Long Zhang, Xiulan Yu, Ying Li, Ying ...
SAC
2006
ACM
15 years 4 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi