More Web Proxy on the site http://driver.im/

Article

Free access

A qualitative comparison study of data structures for large line segment databases

Authors:

Hanan SametAuthors Info & Claims

SIGMOD '92: Proceedings of the 1992 ACM SIGMOD international conference on Management of data

Pages 205 - 214

https://doi.org/10.1145/130283.130316

Published: 01 June 1992 Publication History

Abstract

A qualitative comparative study is performed of the performance of three popular spatial indexing methods - the R-tree, R⁺-tree, and the PMR quadtree-in the context of processing spatial queries in large line segment databases. The data is drawn from the TIGER/Line files used by the Bureau of the Census to deal with the road networks in the US. The goal is not to find the best data structure as this is not generally possible. Instead, their comparability is demonstrated and an indication is given as to when and why their performance differs. Tests are conducted with a number of large datasets and performance is tabulated in terms of the complexity of the disk activity in building them, their storage requirements, and the complexity of the disk activity for a number of tasks that include point and window queries, as well as finding the nearest line segment to a given point and an enclosing polygon.

References

[1]

W. G. Aref and H. Samet, A data-driven window decomposition algorithm for efficient spatial query processing, University of Maryland Computer Science TR 2866, College Park, MD, March 1992.

[2]

N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, The R*-tree : an efficient and robust access method for points and rectangles, Proc. of the SIGMOD Conf., Atlantic City, June 1990, 322-331.

Digital Library

[3]

Bureau of the Census, TIGER/Line precensus files: 1990 technical documentation, Bureau of the Census, Washington, DC, 1989.

[4]

C. Faloutsos, T. Sellis, and N. Roussopoulos, Analysis of object oriented spatial access methods, Proc. of the SIGMOD Conf., San Francisco, May 1987, 426-439.

Digital Library

[5]

J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes, Computer Graphics: Principles and Practice, Second Edition, Addison-Wesley, Reading, MA, 1990.

Digital Library

[6]

W. R. Franklin, Adaptive grids for geometric operations, Cartographica P1, 2&3(Summer & Autumn 1984), 160-167.

[7]

D. Greene, An implementation and performance analysis of spatial data access methods, Proc. of the Fifth IEEE Intl. Conf. on Data Engineering, Los Angeles, February 1989, 606-615.

Digital Library

[8]

O. Giinther, Efficient structures for geometric data management, Ph.D. dissertation, UCB/ERL M87/77, Electronics Research Laboratory, College of Engineering, University of California at Berkeley, Berkeley, CA, 1987 (Lecture Notes in Computer Science 337, Springer-Verlag, Berlin, 1988).

Digital Library

[9]

A. Guttman, R-trees: a dynamic index structure for spatial searching, Proc. of the SIGMOD Co~~, Boston, June 1984, 47-57.

Digital Library

[10]

K. Hinrichs and J. Nievergelt, The grid file: a data structure designed to support proximity queries on spatial objects, Proc. of the WG'83 (Intl. Workshop on Graphtheoretic Concepts in Computer Science), M. Nagl and J. Perl, eds., Trauner Verlag, Linz, Austria, 1983, 100-113.

[11]

E. G. Hoel and H. Samet, Efficient processing of spatial queries in line segment databases, in Advances in Spatial Databases - 2nd Symp., SSD'91, (O. Giinther and It. J. Schek, eds.), Lecture Notes in Computer Science 525, Springer-Verlag, Berlin, 1991,237-256.

Digital Library

[12]

H. V. Jagadish, On indexing line segments, Proc. of the Sixteenth Intl. Conf. on Very Large Data Bases, D. McLeod, R. Sacks-Davis, and H. Schek, eds., Brisbane, Australia, August 1990, 614-625.

Digital Library

[13]

R. C. Nelson and H. Samet, A consistent hierarchical representation for vector data, Computer Graphics 20, 4(August 1986), 197-206 (also Proc. of the SIGGRAPH'86 Conf., Dallas, Aug. 1986).

Digital Library

[14]

R. C. Nelson and H. Samet, A population analysis for hierarchical data structures, Proc. of the SIG- MOD Conf., San Francisco, May 1987, 270-277.

Digital Library

[15]

J. Nievergelt, H. Hinterberger, and K. C. Sevcik, The grid file: an adaptable, symmetric multikey file structure, A CM Trans. on Database Systems 9, 1(March 1984), 38-71.

Digital Library

[16]

J. A. Orenstein, Redundancy in spatial databases, Proc. of the SIGMOD Conf., Portland, OR, June 1989, 294-305.

Digital Library

[17]

J. A. Orenstein and T. H. Merrett, A class of data structures for associative searching, Proc. of the Third A CM SIGA CT-SIGMOD Symp. on Principles of Database Systems, Waterloo, Canada, April 1984, 181-190.

Digital Library

[18]

J. T. Robinson, The k-d-B-tree: a search structure for large multidimensional dynamic indexes, Proc. of the SIGMOD Conf., Ann Arbor, MI, April 1981, 10-18.

Digital Library

[19]

H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.

Digital Library

[20]

H. Samet, Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS, Addison-Wesley, Reading, MA, 1990.

Digital Library

[21]

H. Samet and R. E. Webber, Storing a collection of polygons using quadtrees, A CM Trans. on Graphics 4, 3(July 1985), 182-222.

Digital Library

[22]

C. A. Shaffer, H. Samet, and R. C. Nelson, QUILT: a geographic information system based on quadtrees, in~l. Journal of Geographical Information Systems 4, 2(April-June 1990), 103-131.

[23]

M. Stonebraker, T. Sellis, and E. Hanson, An analysis of rule indexing implementations in data base systems, Proc. of the First Intl. Conf. on Expert Database Systems, Charleston, SC, April 1986, 353-364.

[24]

M. Tamminen, The EXCELL method for efficient geometric access to data, Ac~a Polytechnica Scandinavica, Mathematics and Computer Science Series No. 34, Helsinki, Finland, 1981.

Cited By

Khan AKulik LTanin EHua HHashem T(2018)Efficient Computation of the Optimal Accessible Location for a Group of Mobile AgentsACM Transactions on Spatial Algorithms and Systems10.1145/32391244:4(1-32)Online publication date: 10-Sep-2018
https://dl.acm.org/doi/10.1145/3239124
Singh HBawa S(2017)A Survey of Traditional and MapReduceBased Spatial Query Processing ApproachesACM SIGMOD Record10.1145/3137586.313759046:2(18-29)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1145/3137586.3137590
Ishiyama KKobayashi KSadakane K(2017)Succinct Quadtrees for Road DataSimilarity Search and Applications10.1007/978-3-319-68474-1_18(262-272)Online publication date: 28-Sep-2017
https://doi.org/10.1007/978-3-319-68474-1_18
Show More Cited By

Index Terms

A qualitative comparison study of data structures for large line segment databases
1. Information systems
  1. Information retrieval
    1. Document representation
    2. Search engine architectures and scalability
      1. Search engine indexing
  2. Information storage systems
    1. Record storage systems
      1. Directory structures
        B-trees
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees

Recommendations

A qualitative comparison study of data structures for large line segment databases

A qualitative comparative study is performed of the performance of three popular spatial indexing methods - the R-tree, R⁺-tree, and the PMR quadtree-in the context of processing spatial queries in large line segment databases. The data is drawn from ...
Line segment detectors with deformable attention
Abstract
The object detectors based on Transformers are advancing rapidly. On the contrary, the development of line segment detectors is relatively slow. It is noteworthy that the object and line segments are both 2D targets. In this work, we design a ...
Highlights
- Transforming object detectors, namely Deformable LETR and ViDTLE, into efficient line segment detectors based on the line segment detection loss function.
- Introducing the Line Segment Deformable Attention (LSDA) mechanism to optimize ...
Line segment disk cover
Abstract
In this paper, we consider the following variations of the Line Segment Disk Cover (LSDC) problem.

LSDC-H: In this version of LSDC problem, we are given a set S = { s 1 , s 2 , … , s n } of n horizontal line ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '92: Proceedings of the 1992 ACM SIGMOD international conference on Management of data

June 1992

416 pages

ISBN:0897915216

DOI:10.1145/130283

Editor:
Michael Stonebraker
Univ. of California at Berkeley

ACM SIGMOD Record Volume 21, Issue 2
June 1, 1992
415 pages
ISSN:0163-5808
DOI:10.1145/141484
Editor:
Michael Stonebraker
Issue’s Table of Contents

Copyright © 1992 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS92

Sponsor:

SIGMOD/PODS92: SIGMOD/PODS '92

June 2 - 5, 1992

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

68
Total Citations
View Citations
250
Total Downloads

Downloads (Last 12 months)113
Downloads (Last 6 weeks)20

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Khan AKulik LTanin EHua HHashem T(2018)Efficient Computation of the Optimal Accessible Location for a Group of Mobile AgentsACM Transactions on Spatial Algorithms and Systems10.1145/32391244:4(1-32)Online publication date: 10-Sep-2018
https://dl.acm.org/doi/10.1145/3239124
Singh HBawa S(2017)A Survey of Traditional and MapReduceBased Spatial Query Processing ApproachesACM SIGMOD Record10.1145/3137586.313759046:2(18-29)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1145/3137586.3137590
Ishiyama KKobayashi KSadakane K(2017)Succinct Quadtrees for Road DataSimilarity Search and Applications10.1007/978-3-319-68474-1_18(262-272)Online publication date: 28-Sep-2017
https://doi.org/10.1007/978-3-319-68474-1_18
Roumelis GVassilakopoulos MLoukopoulos TCorral AManolopoulos Y(2015)The xBR$$^+$$-treeProceedings, Part I, of the 26th International Conference on Database and Expert Systems Applications - Volume 926110.1007/978-3-319-22849-5_4(43-58)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-22849-5_4
Ni WChong ZShu HBao JZhou A(2013)Evaluation of RDF queries via equivalenceFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-012-1208-x7:1(20-33)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1007/s11704-012-1208-x
Roumelis GVassilakopoulos MCorral A(2011)Performance comparison of xBR-trees and R*-trees for single dataset spatial queriesProceedings of the 15th international conference on Advances in databases and information systems10.5555/2041746.2041769(228-242)Online publication date: 20-Sep-2011
https://dl.acm.org/doi/10.5555/2041746.2041769
Roumelis GVassilakopoulos MCorral A(2011)Performance Comparison of xBR-trees and R*-trees for Single Dataset Spatial QueriesAdvances in Databases and Information Systems10.1007/978-3-642-23737-9_17(228-242)Online publication date: 2011
https://doi.org/10.1007/978-3-642-23737-9_17
Samet H(2010)Multidimensional data structures for spatial applicationsAlgorithms and theory of computation handbook10.5555/1882757.1882763(6-6)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.5555/1882757.1882763
Chong ZQi GShu HBao JNi WZhou AHuang JKoudas NJones GWu XCollins-Thompson KAn A(2010)Open user schema guided evaluation of streaming RDF queriesProceedings of the 19th ACM international conference on Information and knowledge management10.1145/1871437.1871601(1281-1284)Online publication date: 26-Oct-2010
https://dl.acm.org/doi/10.1145/1871437.1871601
He JWatson LSosonkina M(2009)Algorithm 897ACM Transactions on Mathematical Software10.1145/1527286.152729136:3(1-24)Online publication date: 23-Jul-2009
https://dl.acm.org/doi/10.1145/1527286.1527291
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents