A probabilistic analysis of trie-based sorting of large collections of line segments in spatial databases

SIAM Journal on Computing

Volumn 35, Issue 1, 2006, Pages 22-58

  Lindenbaum, Michael ^a   Samet, Hanan ^b   Hjaltason, Gisli R ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF MARYLAND   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Analysis of algorithms; Cost model; Geometric probability; Large spatial databases; Quadtrees; Quadtries; Query evaluation; Sorting line segments; Spatial data structures; Tries

Indexed keywords

ANALYSIS OF ALGORITHMS; COST MODELS; GEOMETRIC PROBABILITY; LARGE SPATIAL DATABASES; QUADTREES; QUADTRIES; QUERY EVALUATION; SORTING LINE SEGMENTS; SPATIAL DATA STRUCTURES; TRIES;

ALGORITHMS; GEOMETRY; IMAGE ANALYSIS; MATHEMATICAL MODELS; PROBABILITY;

DATABASE SYSTEMS;

EID: 33644587134     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700368527     Document Type: Article

References (56)

1. C. H. ANG, Applications and Analysis of Hierarchical Data Structures, Tech. report TR-2255, Department of Computer Science, University of Maryland, College Park, MD, 1989.
2. W. G. AREF AND H. SAMET, Optimization strategies for spatial query processing, in Proceedings of the 17th Annual International Conference on Very Large Data Bases (VLDB), G. Lohman, ed., Barcelona, Spain, September 1991, pp. 81-90.
3. N. BECKMANN, H. P. KRIEGEL, R. SCHNEIDER, AND B. SEEGER, The R*-tree: An efficient and robust access method for points and rectangles, in Proceedings of the ACM SIGMOD Conference, Atlantic City, NJ, June 1990, pp. 322-331.
4. R. BONEFAS, Personal communication, 1991.
5. R. DE LA BRIANDAIS, File searching using variable-length keys, in Proceedings of the IRE/IEEE/ACM Western Joint Computer Conference, San Francisco, CA, 1959, pp. 295-298.
6. T. BRINKHOFF, H. P. KRIEGEL, R. SCHNEIDER, AND B. SEEGER, Multi-step processing of spatial joins, in Proceedings of the ACM SIGMOD Conference, Minneapolis, MN, June 1994, pp. 197-208.
7. BUREAU OF THE CENSUS, TIGER/Line Census Files, 1990 Technical Documentation, Washington, DC, 1991.
8. C. R. DYER, The space efficiency of quadtrees, Comput. Graphics Image Process., 19 (1982), pp. 335-348.
9. C. FALOUTSOS AND I. KAMEL, Beyond uniformity and independence; Analysis of R-trees using the concept of fractal dimension, in Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Minneapolis, MN, May 1994, pp. 4-13.
10. C. FALOUTSOS, H. V. JAGADISH, AND Y. MANOLOPOULOS, Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles, IEEE Trans. Knowledge Data Engrg., 9 (1997), pp, 373-383.
11. C. FALOUTSOS, T. SELLIS, AND N. ROUSSOPOULOS, Analysis of object oriented spatial access methods, in Proceedings of the ACM SIGMOD Conference, San Francisco, CA, May 1987, pp. 426-439.
12. R. A. FINKEL AND J. L. BENTLEY, Quad trees: A data structure for retrieval on composite keys, Acta Inform., 4 (1974), pp. 1-9.
13. P. FLAJOLET, G. GONNET, C. PUECH, AND J. M. ROBSON, Analytic variations on quadtrees, Algorithmica, 10 (1993), pp. 473-500.
14. P. FLAJOLET AND T. LAFFORGE, Search costs in quadtrees and singularity perturbation asymptotics, Discrete Comput. Geom., 12 (1994), pp. 151-175.
15. P. FLAJOLET AND C. PUECH, Partial match retrieval of multidimensional data, J. ACM, 33 (1986), pp. 371-407.
16. E. FREDKIN, Trie memory, Comm. ACM, 3 (1960), pp. 490-499.
17. G. GRAEFE, Query evaluation techniques for large databases, ACM Comput. Surveys, 25 (1993), pp. 73-170.
18. A. GUTTMAN, R-trees: A dynamic index structure for spatial searching, in Proceedings of the ACM SIGMOD Conference, Boston, MA, June 1984, pp. 47-57,
19. E. G. HOEL AND H. SAMET, Data-parallel spatial join algorithms, in Proceedings of the 23rd International Conference on Parallel Processing, vol. 3, St. Charles, IL, 1994, pp. 227-234.
20. E. G. HOEL AND H. SAMET, Performance of data-parallel spatial operations, in Proceedings of the 20th Annual International Conference on Very Large Data Bases (VLDB), Santiago, Chile, September 1994, pp. 156-167.
21. M. HOSHI AND P. FLAJOLET, Page usage in a quadtree index, BIT, 32 (1992), pp. 384-402.
22. G. M. HUNTER, Efficient Computation and Data Structures for Graphics, Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ, 1978.
23. G. M. HUNTER AND K. STEIGLITZ, Operations on images using quad trees, IEEE Trans. Pattern Anal. Mach. Intell., l (1979), pp. 145-153.
24. C. L. JACKINS AND S. L. TANIMOTO, Oct-trees and their use in representing three dimensional objects, Comput. Graphics Image Process., 14 (1980), pp. 249-270.
25. G. KEDEM, The quad-CIF tree: A data structure for hierarchical in-line algorithms, in Proceedings of the ACM/IEEE 19th Annual Design Automation Conference, Las Vegas, NV, June 1982, pp. 352-257.
26. A. KLINGER, Patterns and search statistics, in Optimizing Methods in Statistics, J. S. Rustagi, ed., Academic Press, New York, 1971, pp. 303-337.
27. K. KNOWLTON, Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes, Proc. IEEE 68 (1980), pp. 885-896.
28. D. E. KNUTH, The Art of Computer Programming: Sorting and Searching, vol. 3, 2nd ed., Addison-Wesley, Reading, MA, 1998.
29. J. H. LEE, D. H. KIM, AND C. W. CHUNG, Multi-dimensional selectivity estimation using compressed histogram information, in Proceedings of the ACM SIGMOD Conference, Philadelphia, PA, June 1999, pp. 205-214.
30. C. MATHIEU, C. PUECH, AND H. YAHIA, Average efficiency of data structures for binary image processing, Inform. Process. Lett., 26 (1987), pp. 89-93.
31. Y. MATIAS, J. S. VITTER, AND M. WANG, Wavelet-based histograms for selectivity estimation, in Proceedings of the ACM SIGMOD Conference, Seattle, WA, June 1998, pp. 448-459.
32. D. MEAGHER, Geometric modeling using octree encoding, Comput. Graphics Image Process., 19 (1982), pp. 129-147.
33. B. MOON AND J. H. SALTZ, Scalability analysis of declustering methods for multidimensional range queries, IEEE Trans. Knowledge Data Engrg., 10 (1998), pp. 310-327.
34. M. MURALIKRISHNA AND D. J. DEWITT, Equi-depth histograms for estimating selectivity factors for multi-dimensional queries, in Proceedings of the ACM SIGMOD Conference, Chicago, IL, June 1988, pp. 28-36.
35. R. C. NELSON AND H. SAMET, A consistent hierarchical representation for vector data, Comput. Graphics, 20 (1986), pp. 197-206.
36. R. C. NELSON AND H. SAMET, A Population Analysis of Quadtrees with Variable Node Size, Tech. report TR-1740, Department of Computer Science, University of Maryland, College Park, MD, December 1986.
37. R. C. NELSON AND H. SAMET, A population analysis for hierarchical data structures, in Proceedings of the ACM SIGMOD Conference, San Francisco, CA, May 1987, pp. 270-277.
38. J. A. ORENSTEIN, Spatial query processing in an object-oriented database system, in Proceedings of the ACM SIGMOD Conference, Washington, DC, May 1986, pp. 326-336.
39. M. OUKSEL AND P. SCHEUERMANN, Storage mappings for multidimensional linear dynamic hashing, in Proceedings of the ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS), Atlanta, GA, March 1983, pp. 90-105.
40. B. U. PAGEL, H. W. SIX, H. TOBEN, AND P. WIDMAYER, Towards an analysis of range query performance in spatial data structures, in Proceedings of the 12th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Washington, DC, May 1993, pp. 214-221.
41. A. PAPOULIS, Probability, Random Variables, and Stochastic Processes, 3rd ed., McGraw Hill, New York, 1991.
42. C. PUECH AND H. YAHIA, Quadtrees, octrees, hyperoctrees: A unified analytical approach to three data structures used in graphics, geometric modeling and image processing, in Proceedings of the ACM Symposium on Computational Geometry, Baltimore, MD, June 1985, pp. 272-280.
43. H. SAMET, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.
44. H. SAMET, Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS, Addison-Wesley, Reading, MA, 1990.
45. H. SAMET, Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann, San Francisco, CA, 2006.
46. H. SAMET, A. ROSENFELD, C. A. SHAFFER, R. C. NELSON, AND Y. G. HUANG, Application of hierarchical data structures to geographical information systems: Phase III, Tech. report TR-1457, Department of Computer Science, University of Maryland, College Park, MD, 1984.
47. H. SAMET, C. A. SHAFFER, AND R. E. WEBBER, Digitizing the plane with cells of non-uniform size, Inform. Process. Lett., 24 (1987), pp. 369-375.
48. H. SAMET AND M. TAMMINEN, Efficient component labeling of images of arbitrary dimension represented by linear bintrees, IEEE Trans. Pattern Anal. Mach. Intell., 10 (1988), pp. 579-586.
49. H. SAMET AND R. E. WEBBER, Storing a collection of polygons using quadtrees, ACM Trans. Graphics, 4 (1985), pp. 182-222.
50. L. A. SANTALO, Integral Geometry and Geometric Probability, Encyclopedia of Math. Appl. 1, Addison-Wesley, Reading, MA, 1976.
51. C. A. SHAFFER, A formula for computing the number of quadtree node fragments created by a shift, Pattern Recognition Lett., 7 (1988), pp. 45-49.
52. C. A. SHAFFER, R. JUVVADI, AND L. S. HEATH, Generalized comparison of quadtree and bintree storage requirements, Image Vision Comput., 11 (1993), pp. 402-412.
53. C. A. SHAFFER, H. SAMET, AND R. C. NELSON, QUILT: A geographic information system based on quadtrees, Int. J. Geographical Inform. Systems, 4 (1990), pp. 103-131.
54. M. TAMMINEN, Encoding pixel trees, Comput. Vision Graphics Image Process., 28, (1984), pp. 44-57.
55. M. TAMMINEN, Comment on quad- and octtrees, Comm. ACM, 27 (1984), pp. 248-249.
56. M. VASSILAKOPOULOS AND Y. MANOLOPOULOS, Analytical results on the quadtree storage-requirements, in Proceedings of the 5th International Conference on Computer Analysis of Images and Patterns (CAIP '93), D. Chetverikov and W. G. Kropatsch, eds., Lecture Notes Comput. Sci. 719, Springer-Verlag, Berlin, 1993, pp. 41-48.