skip to main content
10.1145/2213556.2213575acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
research-article

Space-efficient range reporting for categorical data

Published: 21 May 2012 Publication History

Abstract

In the colored (or categorical) range reporting problem the set of input points is partitioned into categories and stored in a data structure; a query asks for categories of points that belong to the query range. In this paper we study two-dimensional colored range reporting in the external memory model and present I/O-efficient data structures for this problem.
In particular, we describe data structures that answer three-sided colored reporting queries in O(K/B) I/Os and two-dimensional colored reporting queries in(log2logB N + K/B) I/Os when points lie on an N x N grid, K is the number of reported colors, and B is the block size. The space usage of both data structures is close to optimal.

References

[1]
A. Aggarwal and J. S. Vitter, The Input/OutputComplexity of Sorting and Related Problems, Communications of the ACM (CACM),31(9), 1116--1127, 1988.
[2]
P. Agarwal, S. Govindarajan, S. Muthukrishnan, Range Searching in Categorical Data: Colored Range Searching on Grid,Proc. 10th European Symp. on Algorithms (ESA) 2002, 17--28.
[3]
L. Arge, V. Samoladas, J. S. Vitter, On Two-Dimensional Indexability and Optimal Range Search Indexing, Proc. 18th ACM Symp. on Principles of Database Systems(PODS) 1999, 346--357.
[4]
B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, An Asymptotically Optimal Multiversion B-Tree, VLDB Journal, 5(4), 264--275, 1996.
[5]
J. L. Bentley, Multidimensional Divide-and-Conquer, Commun. ACM 23, 214--229, 1980.
[6]
P. Bozanis, N. Kitsios, C. Makris, A.-K. Tsakalidis, New Upper Bounds for GeneralizedIntersection Searching Problems, Proc. 22nd Int. Colloquium on Automata, Languagesand Programming (ICALP), 1995, 464--474.
[7]
P. Bozanis, N. Kitsios, C. Makris, A.-K. Tsakalidis, New Results on Intersection Query Problems, Computer Journal 40(1), 22--29 (1997).
[8]
B. Chazelle, A Functional Approach to Data Structures and Its Use in Multidimensional Searching, SIAM Journal on Computing 17(3), 427--462, 1988.
[9]
J. R. Driscoll, N. Sarnak, D. D. Sleator, R. E. Tarjan, Making Data Structures Persistent, J. Comput. Syst. Sci. 38(1), 86--124 (1989).
[10]
H. N. Gabow, J. L. Bentley, R. E. Tarjan, Scaling and Related Techniques for Geometry Problems, Proc. 16th ACM Symp. on Theory of Computing (STOC) 1984, 135--143.
[11]
T. Gagie, G. Navarro, and S. J. Puglisi, Colored Range Queries and Document Retrieval,Proc. 17th Int. Symp. on String Processing and Information Retrieval (SPIRE) 2010, 67--81.
[12]
P. Gupta, R. Janardan, M. Smid, Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization, Journal of Algorithms 19(2), 282--317, 1995.
[13]
P. Gupta, R. Janardan, and M. Smid, Efficient Algorithms for Generalized IntersectionSearching on Non-Iso-oriented Objects, Computational Geometry: Theory & Applications 6(1), 1--19, 1996.
[14]
R. Janardan, M. Lopez, Generalized Intersection Searching Problems, Internat. J. Comput. Geom. Appl. 3, 39--69, 1993.
[15]
H. Kaplan, Persistent Data Structures, In Handbook on Data Structures and Applications, D. Mehta and S. Sahni, editors, CRC Press, 2005.
[16]
M. Karpinski and Y. Nekrich, Searching for Frequent Colors in Rectangles,Proc. Canadian Conf. on Computational Geometry (CCCG) 2008.
[17]
. Karpinski and Y. Nekrich, Top-K Color Queries for Document Retrieval, Proc. 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA) 2011, 401--411.
[18]
G. Navarro, Y. Nekrich, Top-k Document Retrieval in Optimal Time and Linear Space, Proc. 23rd ACM-SIAM Symp. on Discrete Algorithms (SODA) 2012, 1066--1077.
[19]
K. G. Larsen, R. Pagh, I/O-Efficient Data Structures for Colored Range and Prefix Reporting,Proc. 23rd ACM-SIAM Symp. on Discrete Algorithms (SODA) 2012, to appear.
[20]
. Muthukrishnan, Efficient Algorithms for Document Retrieval Problems, Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA) 2002, 657--666.
[21]
E. M. McCreight, Priority Search Trees, SIAM Journal on Computing 14(2), 257--276, 1985.
[22]
A. Nanopoulos, P. Bozanis, Categorical Range Queires in Large Databases,Proc. 8th Int. Symp. on Advances in Spatial and Temporal Databases (SSTD) 2003, 122--139.
[23]
Y. Nekrich, External Memory Range Reporting on a Grid,Proc. 18th Int. Symp. on Algorithms and Computation (ISAAC) 2007, 525--535.
[24]
Y. Nekrich, External Memory Orthogonal Range Reporting with Fast Updates,Proc. 22nd Int. Symp. on Algorithms and Computation (ISAAC) 2011, 395--404.
[25]
M. Pǎtraşcu, M. Thorup, Time-space Trade-offs for Predecessor Search, Proc. 38th ACM Symp. on Theory of Computing (STOC) 2006, 232--240.
[26]
S. Ramaswamy, S. Subramanian, Path Caching: A Technique for Optimal External Searching, Proc. 13th ACM Symp. on Principles of Database Systems(PODS) 1994, 25--35.
[27]
. Subramanian, S. Ramaswamy, The P-range Tree: A New Data Structure for Range Searching in Secondary Memory, Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (SODA) 1995, 378--387.
[28]
. J. Varman, R. M. Verma, An Efficient Multiversion Access Structure, IEEE Transactions on Knowledge and Data Engineering, 9(3), 391--409, 1997.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems
May 2012
332 pages
ISBN:9781450312486
DOI:10.1145/2213556
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: 21 May 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. colored range reporting
  2. data structures
  3. orthogonal range reporting

Qualifiers

  • Research-article

Conference

SIGMOD/PODS '12
Sponsor:

Acceptance Rates

PODS '12 Paper Acceptance Rate 26 of 101 submissions, 26%;
Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2014)Categorical range maxima queriesProceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/2594538.2594557(266-277)Online publication date: 18-Jun-2014
  • (2014)Efficient range searching for categorical and plain dataACM Transactions on Database Systems10.1145/254392439:1(1-21)Online publication date: 6-Jan-2014
  • (2014)Colored Range Searching in Linear SpaceAlgorithm Theory – SWAT 201410.1007/978-3-319-08404-6_20(229-240)Online publication date: 2014
  • (2013)Near-optimal range reporting structures for categorical dataProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627837(265-277)Online publication date: 6-Jan-2013
  • (2013)Top-k Document Retrieval in External MemoryAlgorithms – ESA 201310.1007/978-3-642-40450-4_68(803-814)Online publication date: 2013
  • (2013)Optimal Color Range Reporting in One DimensionAlgorithms – ESA 201310.1007/978-3-642-40450-4_63(743-754)Online publication date: 2013
  • (2012)Skewness‐aware clustering tree for unevenly distributed spatial sensor nodes in smart cityInternational Journal of Communication Systems10.1002/dac.247726:9(1143-1162)Online publication date: 11-Dec-2012

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media