2026-07-23T04:52:35Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5724 2024-03-06T10:36:56Z ddc:004 open_access

External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates Brodal, Gerth Stølting External memory priority search tree 3-sided range reporting top-k queries An external memory data structure is presented for maintaining a dynamic set of N two-dimensional points under the insertion and deletion of points, and supporting unsorted 3-sided range reporting queries and top-k queries, where top-k queries report the k points with highest y-value within a given x-range. For any constant 0 < epsilon <= 1/2, a data structure is constructed that supports updates in amortized O(1/(epsilon * B^{1-epsilon}) * log_B(N)) IOs and queries in amortized O(1/epsilon * log_B(N+K/B)) IOs, where B is the external memory block size, and K is the size of the output to the query (for top-k queries K is the minimum of k and the number of points in the query interval). The data structure uses linear space. The update bound is a significant factor B^{1-epsilon} improvement over the previous best update bounds for these two query problems, while staying within the same query and space bounds. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Gerth Stølting Brodal 2016 Is Part Of LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2016.23 urn:nbn:de:0030-drops-57241 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.23 eng https://creativecommons.org/licenses/by/3.0/legalcode