Download:
|
by Shashi Shekhar, Chang-tien Lu, Sivakumar Ravada, Sanjay Chawla
Symposium on Reliability in Distributed Software
http://www-users.cs.umn.edu/~ctlu/PaperTalkFile/srds-paper.ps
Add To MetaCart
Abstract:
A Join Index is a data structure that optimizes the join query processing in spatial databases. Join indices use pre-computation techniques to speed up online query processing and are useful for applications which require low update rates. The cost of spatial join computation using a join-index with limited buffer space depends primarily on the page access sequence used to fetch the pages of the base relations. Given the join-index, we introduce a suite of methods based on spatial-clustering to compute the spatial-join. The spatial clustering we employ is based on graph partitioning techniques. For all the methods we derive upper-bounds on the lengths of the page-access sequence. Experimental results with Sequoia 2000 data sets, on a sequential system, show that spatial clustering method outperforms the existing methods based on sorting and online clustering heuristics. Acronym Full form Definition section/page AGP Asymmetric Graph Partitioning based heuristic Section 3 SGP Symmetric Graph Partitioning Based heuristic Section 5 FP Fotouhi and Pramanik's heuristic Section 2 OM Omiecinski's heuristic Section 2 Chan Chan's heuristic Section 2 Sorting Sorting heuristic Section 2
Citations
|
7715
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
771
|
An efficient heuristic procedure for partitioning graphs, The Bell Syst
– Kernighan, Lin
- 1970
|
|
521
|
Query evaluation techniques for large databases
– Graefe
- 1993
|
|
270
|
Parallel processing of spatial joins using r-trees
– Brinkhoff, Kriegel, et al.
- 1996
|
|
266
|
What is a Data Warehouse
– Inmon
- 1995
|
|
174
|
Join Indices
– Valduriez
- 1987
|
|
135
|
Fast spectral methods for ratio cut partitioning and clustering
– Hagen, Kahng
- 1991
|
|
130
|
Multi-step processing of spatial joins
– Brinkhoff, Kriegel, et al.
- 1994
|
|
105
|
Indexing techniques for queries on nested objects
– Bertino, Kim
- 1989
|
|
102
|
Spatial joins using seeded trees
– Lo, Ravishankar
- 1994
|
|
93
|
Efficient computation of spatial joins
– Gunther
- 1993
|
|
77
|
Access support in object bases
– Kemper, Moerkotte
- 1990
|
|
77
|
Spatial join indices
– Rotem
- 1991
|
|
75
|
An overview of the Sequoia 2000 project
– Stonebraker
- 1992
|
|
39
|
CCAM: A connectivity-clustered access method for networks and network computations
– Shekhar, Liu
- 1997
|
|
36
|
A new algorithm for computing joins with grid files
– Becker, Hinrichs, et al.
- 1993
|
|
20
|
A similarity graph-based approach to declustering problems and its applications towards parallelizing grid files
– Liu, Shekhar
- 1995
|
|
19
|
Overlay processing in spatial information systems
– Frank
- 1987
|
|
14
|
Scheduling of Page-Fetches in Join Operations
– Merrett, Kambayashi, et al.
- 1981
|
|
11
|
Heuristics for Join Processing Using Nonclustered Indexes
– Omiecinski
- 1989
|
|
9
|
Exploring Spatial Analysis in Geographic Information Systems
– Chou
- 1997
|
|
8
|
Optimal Secondary Storage Access Sequence for Performing Relational Join
– Fotouhi, Pramanik
- 1989
|
|
6
|
Performance of a composite attribute and join index
– Desai
- 1989
|
|
2
|
and Beng Chin Ooi. Efficient Scheduling of Page Access in Index-Based Join Processing
– Chan
- 1997
|
|
2
|
Scheduling of Page Fetches in Join Operation Using Bc-Trees
– Goyal, Li, et al.
- 1988
|
|
2
|
Use of Graph Theoritic Models for Optimal Relational Database Accesses to Perform Join
– Pramanik, Ittner
- 1985
|
|
1
|
Multilevel hpergraph partitioning
– Karypis, Aggarwal, et al.
- 1997
|
|
1
|
Spatial Query Processing by Approximations
– Lu, Luo, et al.
- 1995
|
|
1
|
The Traveling Salesman: Computatinal Solutins for TSP Applications
– Reinelt
- 1994
|
