Article

Space efficient dynamic stabbing with fast queries

Author:

Mikkel ThorupAuthors Info & Claims

STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Pages 649 - 658

https://doi.org/10.1145/780542.780636

Published: 09 June 2003 Publication History

Abstract

In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method look-up in object oriented programming languages and classification in IP firewalls. For such application, very fast, say constant, query time is extremely important, small space is very important, and fast updates are good but the least important. Previous solutions traded space and update time for fast queries. We show here that space needs not be sacrificed. We get the same trade-off between update time and query time but using only the space necessary for locating a query point among the interval end-points. All our bounds are optimal or near-optimal.

References

[1]

S. Alstrup, T. Husfeldt, and T. Rauhe. Marked ancestor problems. In Proc. 39th FOCS, pages 534--543, 1998.

Digital Library

[2]

A. Andersson. Sublogarithmic searching without multiplications. In Proc. 36th FOCS, pages 655--663, 1995.

Digital Library

[3]

A. Andersson. Faster deterministic sorting and searching in linear space. In Proc. 37th FOCS, pages 135--141, 1996.

Digital Library

[4]

A. Andersson and M. Thorup. Tight(er) bounds on dynamic searching and priority queues. In Proc. 32nd STOC, pages 335--342, 2000.

Digital Library

[5]

A. Andersson and M. Thorup. Dynamic ordered sets with exponential search trees. Technical Report cs.DS/0210006, The Computing Research Repository (CoRR), 2002. http://arXiv.org/abs/cs.DS/0210006. Combined journal version of {3,4}.

[6]

P. Beame and F. Fich. Optimal bounds for the predecessor problem and related problems. J. Comp. Syst. Sc., 65(1):38--72, 1999. Announced at STOC'99.

Digital Library

[7]

J. L. Bentley. Algorithms for Klee's rectangle problem. Technical report, Carnegie-Mellon University, 1977.

[8]

M. De Berg, M. Van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 1997.

[9]

S. Deering and R. Hinden. Internet protocol, version 6 (IPv6), specification. Network Working Group, Request for Comments, http://search.ietf.org/rfc/rfc1883.txt, December 1995.

Digital Library

[10]

H. Edelsbrunner. Dynamic data structures for orthogonal intersection queries. Technical Report F59, Inst. Informationsverarb., Tech. Univ. Graz, 1980.

[11]

A. Feldmann and S. Muthukrishnan. Tradeoffs for packet classification. In Proc. IEEE INFOCOM, pages 1193--1202, 2000.

[12]

P. Ferragina and S. Muthukrishnan. Efficient dynamic method-lookup for object oriented languages (extended abstract). In Proc. 4th ESA, pages 107--120, 1996.

Digital Library

[13]

P. Ferragina, S. Muthukrishnan, and M. Berg. Multi-method dispatching: a geometric approach with applications to string matching problems. In Proc. 31th STOC, pages 483--491, 1999.

Digital Library

[14]

M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci., 47:424--436, 1993. See also STOC'90.

Digital Library

[15]

H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proc. 16th STOC, pages 135--143, 1984.

Digital Library

[16]

T. Hagerup, P. B. Miltersen, and R. Pagh. Deterministic dictionaries. J. Algor., 41:69--85, 2001.

Digital Library

[17]

IEEE. IEEE standard for binary floating-point arithmetic. ACM Sigplan Notices, 22:9--25, 1985.

[18]

E. M. McCreight. Efficient algorithms for enumerating intersecting intervals and rectangles. Technical Report CSL-80-9, Xerox Corp., 1980.

[19]

E. M. McCreight. Priority search trees. SIAM J. Comp., 14(2):257--276, 1985.

Digital Library

[20]

K. Mehlhorn and S. Nahler. Bounded ordered dictionaries in O(loglog n) time and O(n) space. Information Processing Letters, 35(4):183--189, 1990.

Digital Library

[21]

M. H. Overmars. Computational geometry on a grid: an overview. NATO ASI Series, F40:167--184, 1988.

[22]

P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6(3):80--82, 1977.

[23]

P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Syst. Theory, 10:99--127, 1977.

Cited By

Boneh IGolan SLevy APorat EShalom B(2024)Burst Edit DistanceString Processing and Information Retrieval10.1007/978-3-031-72200-4_4(41-56)Online publication date: 23-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-72200-4_4
Khramtcova ELöffler M(2017)Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping IntervalsComputer Science – Theory and Applications10.1007/978-3-319-58747-9_17(176-190)Online publication date: 6-May-2017
https://doi.org/10.1007/978-3-319-58747-9_17
Bille PGortz I(2011)The tree inclusion problemACM Transactions on Algorithms10.1145/1978782.19787937:3(1-47)Online publication date: 15-Jul-2011
https://dl.acm.org/doi/10.1145/1978782.1978793
Show More Cited By

Index Terms

Recommendations

Space-efficient data-analysis queries on grids

We consider various data-analysis queries on two-dimensional points. We give new space/time tradeoffs over previous work on geometric queries such as dominance and rectangle visibility, and on semigroup and group queries such as sum, average, variance, ...
Lightning fast and space efficient inequality joins
Proceedings of the 41st International Conference on Very Large Data Bases, Kohala Coast, Hawaii

Inequality joins, which join relational tables on inequality conditions, are used in various applications. While there have been a wide range of optimization methods for joins in database systems, from algorithms such as sort-merge join and band join, ...
Efficient approximations of conjunctive queries
PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems

When finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. In this paper we study such ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

June 2003

740 pages

ISBN:1581136749

DOI:10.1145/780542

Conference Chair:
Lawrence L. Larmore
University of Nevada Las Vegas, Las Vegas, NV
,
Program Chair:
Michel X. Goemans
Massachusetts Institute of Technology, Cambridge, MA

Copyright © 2003 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: 09 June 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

STOC03

Sponsor:

STOC03: The 35th Annual ACM Symposium on Theory of Computing

June 9 - 11, 2003

CA, San Diego, USA

Acceptance Rates

STOC '03 Paper Acceptance Rate 80 of 270 submissions, 30%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
680
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)6

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Boneh IGolan SLevy APorat EShalom B(2024)Burst Edit DistanceString Processing and Information Retrieval10.1007/978-3-031-72200-4_4(41-56)Online publication date: 23-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-72200-4_4
Khramtcova ELöffler M(2017)Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping IntervalsComputer Science – Theory and Applications10.1007/978-3-319-58747-9_17(176-190)Online publication date: 6-May-2017
https://doi.org/10.1007/978-3-319-58747-9_17
Bille PGortz I(2011)The tree inclusion problemACM Transactions on Algorithms10.1145/1978782.19787937:3(1-47)Online publication date: 15-Jul-2011
https://dl.acm.org/doi/10.1145/1978782.1978793
Nekrich Y(2011)A dynamic stabbing-max data structure with sub-logarithmic query timeProceedings of the 22nd international conference on Algorithms and Computation10.1007/978-3-642-25591-5_19(170-179)Online publication date: 5-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25591-5_19
Pellegrini MFusco G(2008)Efficient IP table lookup via adaptive stratified trees with selective reconstructionsACM Journal of Experimental Algorithmics10.1145/1227161.127837612(1-28)Online publication date: 12-Jun-2008
https://dl.acm.org/doi/10.1145/1227161.1278376
Patrascu M(2008)(Data) STRUCTURESProceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science10.1109/FOCS.2008.69(434-443)Online publication date: 25-Oct-2008
https://dl.acm.org/doi/10.1109/FOCS.2008.69
Bille PFarach-Colton M(2008)Fast and compact regular expression matchingTheoretical Computer Science10.1016/j.tcs.2008.08.042409:3(486-496)Online publication date: 20-Dec-2008
https://dl.acm.org/doi/10.1016/j.tcs.2008.08.042
Applegate DCalinescu GJohnson DKarloff HLigett KWang JGabow H(2007)Compressing rectilinear pictures and minimizing access control listsProceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/1283383.1283498(1066-1075)Online publication date: 7-Jan-2007
https://dl.acm.org/doi/10.5555/1283383.1283498
Andersson AThorup M(2007)Dynamic ordered sets with exponential search treesJournal of the ACM10.1145/1236457.123646054:3(13-es)Online publication date: 1-Jun-2007
https://dl.acm.org/doi/10.1145/1236457.1236460
Pătraşcu MThorup MKleinberg J(2006)Time-space trade-offs for predecessor searchProceedings of the thirty-eighth annual ACM symposium on Theory of Computing10.1145/1132516.1132551(232-240)Online publication date: 21-May-2006
https://dl.acm.org/doi/10.1145/1132516.1132551
Show More Cited By

View Options

Get Access

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents