See this document in CiteSeerX!

I/O-Efficient Join Algorithms for Temporal, Spatial, and Constraint Databases (1996)  (Make Corrections)  (2 citations)
Sridhar Ramaswamy, Torsten Suel



  Home/Search   Context   Related

 
View or download:
belllabs.com/user/srid...suelrep.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  belllabs.com/user/sridhar/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We examine I/O-efficient algorithms for join problems arising in spatial, temporal, and constraint databases. Along with retrieval (implemented by hashing or indexing), the join is one of the most I/O-intensive operations in database systems. The join problem in many data models can be defined as the intersection between two sets of orthogonal rectangles in d dimensions. In this paper, we present new I/O-efficient algorithms for the d-dimensional join problem in one, two, and three... (Update)

Context of citations to this paper:   More

...B that during 1995 2000 were also working at IBM . Previous temporal join research has focused on non indexed joins ([GS91, LM93, RF93, SSJ94, RS96, SE96, Zur97]) The common approach is to scan both relations and select the records that need to be joined. Even though a plain...

...that during 1995 2000 were also working at IBM . Previous temporal join research has focused on non indexed joins ([GS91, LM93, RF93, SSJ94, RS96, SE96, Zur97]) The common approach is to scan both relations and select the records that need to be joined. Even though a plain...

Cited by:   More
Efficient Temporal Join Processing using Indices - Zhang, Tsotras, Seeger   (Correct)

Similar documents (at the sentence level):
20.6%:   Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Efficient Indexing for Constraint and Temporal Databases - Ramaswamy (1997)   (Correct)
0.5:   Theory and Practice of I/O-Efficient Algorithms.. - Arge, Procopiuc.. (1998)   (Correct)
0.3:   Video Database on WWW - Hauglid, Heggland, Midtstraum (1999)   (Correct)

Similar documents based on text:   More   All
0.2:   Theory and Practice of IO-Efficient Algorithms for.. - Arge, al.   (Correct)
0.2:   A Unified Approach For Indexed and Non-Indexed Spatial.. - Arge, Procopiuc.. (2000)   (Correct)
0.2:   Routing and Sorting on Fixed Topologies - Suel (1994)   (Correct)

Related documents from co-citation:   More   All
2:   Spatial joins using r-trees: breadth-first traversal with global optimizations - Huang, Jing et al. - 1997
2:   Efficient processing of time-joins in temporal data bases (context) - Rana, Fotouhi - 1993
2:   der and B. Seeger, "The R* tree: An Efficient and Robust Access Method for Point.. (context) - Bechmann, Kriegel et al. - 1990

BibTeX entry:   (Update)

S. Ramaswamy and T. Suel, "I/O-Efficient Join Algorithms for Temporal, Spatial, and Constraint Databases", Bell Labs TechReport, URL: http://www.bell-labs.com/user/sridhar/ftp/suelrep.ps.gz, 1996. http://citeseer.ist.psu.edu/ramaswamy96ioefficient.html   More

@misc{ ramaswamy96oefficient,
  author = "S. Ramaswamy and T. Suel",
  title = "O-Efficient Join Algorithms for Temporal, Spatial, and Constraint Databases",
  text = "S. Ramaswamy and T. Suel, I/O-Efficient Join Algorithms for Temporal, Spatial,
    and Constraint Databases, Bell Labs TechReport, URL: http://www.bell-labs.com/user/sridhar/ftp/suelrep.ps.gz,
    1996.",
  year = "1996",
  url = "citeseer.ist.psu.edu/ramaswamy96ioefficient.html" }
Citations (may not include all citations):
666   The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
330   Query Evaluation Techniques for Large Databases (context) - Graefe - 1993
315   Constraint Query Languages - Kanellakis, Kuper et al. - 1990
229   Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
159   Efficient Processing of Spatial Joins Using R -trees (context) - Brinkhoff, Kriegel et al. - 1993
121   External-Memory Computational Geometry - Goodrich, Tsay et al. - 1993
106   Priority Search Trees (context) - McCreight - 1985
103   Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy et al. - 1993
62   Optimal Dynamic Interval Management in External Memory - Arge, Vitter - 1996
60   The Buffer Tree: A New Technique for Optimal I/O-Algorithms (context) - Arge - 1995
59   Deterministic Distribution Sort in Shared and Distributed Me.. (context) - Nodine, Vitter - 1993
54   Spatial Join Indices (context) - Rotem - 1991
53   Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian - 1994
53   Efficient Computations of Spatial Joins - Gunther - 1993
50   External-Memory Algorithms for Processing Line Segments in G.. - Arge, Vengroff et al. - 1995
37   Algorithms for Klee's Rectangle Problems (context) - Bentley - 1977
32   Efficient Evaluation of the Valid-Time Natural Join - Soo, Snodgrass et al. - 1994
29   Batched Dynamic Solutions to Decomposable Searching Problems (context) - Edelsbrunner, Overmars - 1985
22   Query Processing Algorithms for Temporal Intersection Joins (context) - Gunadhi, Segev - 1991
20   Priority Search Trees in Secondary Memory (context) - Icking, Klein et al. - 1988
19   Counting and Reporting Intersections of d-Ranges (context) - Six, Wood - 1982
13   A New Approach to Rectangle Intersections, Part (context) - Edelsbrunner - 1983
13   A New Approach to Rectangle Intersections, Part II (context) - Edelsbrunner - 1983
3   Cummings Publishing Company Inc (context) - Tanzel, Clifford et al. - 1993
2   The P-range tree: A new data structure for range searching i.. - Subramanian, Ramaswamy - 1995
1   Efficient 3-D Range Searching in External memory (context) - Vengroff, Vitter - 1996
1   O Complexity of Sorting and Related Problems (context) - Aggarwal, Vitter - 1988

Documents on the same site (http://www.bell-labs.com/user/sridhar/):   More
OODB Indexing by Class-Division - Ramaswamy, Kanellakis (1995)   (Correct)
Indexing for Data Models with Classes and Constraints - Ramaswamy (1994)   (Correct)
Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC