Path and Ancestor Queries over Trees with Multidimensional Weight Vectors

Authors Meng He, Serikzhan Kazi

Thumbnail PDF


  • Filesize: 0.56 MB
  • 17 pages

Document Identifiers

Author Details

Meng He
  • Faculty of Computer Science, Dalhousie University, Canada
Serikzhan Kazi
  • Faculty of Computer Science, Dalhousie University, Canada

Cite AsGet BibTex

Meng He and Serikzhan Kazi. Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 45:1-45:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


We consider an ordinal tree T on n nodes, with each node assigned a d-dimensional weight vector w in {1,2,...,n}^d, where d in N is a constant. We study path queries as generalizations of well-known {orthogonal range queries}, with one of the dimensions being tree topology rather than a linear order. Since in our definitions d only represents the number of dimensions of the weight vector without taking the tree topology into account, a path query in a tree with d-dimensional weight vectors generalize the corresponding (d+1)-dimensional orthogonal range query. We solve {ancestor dominance reporting} problem as a direct generalization of dominance reporting problem, in time O(lg^{d-1}{n}+k) and space of O(n lg^{d-2}n) words, where k is the size of the output, for d >= 2. We also achieve a tradeoff of O(n lg^{d-2+epsilon}{n}) words of space, with query time of O((lg^{d-1} n)/(lg lg n)^{d-2}+k), for the same problem, when d >= 3. We solve {path successor problem} in O(n lg^{d-1}{n}) words of space and time O(lg^{d-1+epsilon}{n}) for d >= 1 and an arbitrary constant epsilon > 0. We propose a solution to {path counting problem}, with O(n(lg{n}/lg lg{n})^{d-1}) words of space and O((lg{n}/lg lg{n})^{d}) query time, for d >= 1. Finally, we solve {path reporting problem} in O(n lg^{d-1+epsilon}{n}) words of space and O((lg^{d-1}{n})/(lg lg{n})^{d-2}+k) query time, for d >= 2. These results match or nearly match the best tradeoffs of the respective range queries. We are also the first to solve path successor even for d = 1.

Subject Classification

ACM Subject Classification
  • Information systems → Data structures
  • Theory of computation → Data structures design and analysis
  • Information systems → Multidimensional range search
  • path queries
  • range queries
  • algorithms
  • data structures
  • theory


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Peyman Afshani. On Dominance Reporting in 3D. In ESA, pages 41-51, 2008. Google Scholar
  2. Noga Alon and Baruch Schieber. Optimal preprocessing for answering on-line product queries. Technical report, Tel-Aviv University, 1987. Google Scholar
  3. Timothy M. Chan. Persistent Predecessor Search and Orthogonal Point Location on the Word RAM. In SODA, pages 1131-1145, 2011. Google Scholar
  4. Timothy M. Chan, Meng He, J. Ian Munro, and Gelin Zhou. Succinct Indices for Path Minimum, with Applications. Algorithmica, 78(2):453-491, 2017. Google Scholar
  5. Timothy M. Chan, Kasper Green Larsen, and Mihai Patrascu. Orthogonal range searching on the RAM, revisited. In SoCG, pages 1-10, 2011. Google Scholar
  6. Bernard Chazelle. Computing on a free tree via complexity-preserving mappings. Algorithmica, 2(1):337-361, 1987. Google Scholar
  7. Bernard Chazelle and Herbert Edelsbrunner. Linear Space Data Structures for Two Types of Range Search. Discrete & Computational Geometry, 2:113-126, 1987. Google Scholar
  8. Erik D. Demaine, Gad M. Landau, and Oren Weimann. On Cartesian Trees and Range Minimum Queries. Algorithmica, 68(3):610-625, 2014. Google Scholar
  9. Martin Farach and S. Muthukrishnan. Perfect Hashing for Strings: Formalization and Algorithms. In CPM, pages 130-140, 1996. Google Scholar
  10. Harold N. Gabow, Jon Louis Bentley, and Robert E. Tarjan. Scaling and Related Techniques for Geometry Problems. In STOC, pages 135-143, 1984. Google Scholar
  11. Roberto Grossi, Alessio Orlandi, Rajeev Raman, and S. Srinivasa Rao. More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. In STACS, pages 517-528, 2009. Google Scholar
  12. Torben Hagerup. Parallel Preprocessing for Path Queries Without Concurrent Reading. Inf. Comput., 158(1):18-28, 2000. Google Scholar
  13. Meng He, J. Ian Munro, and Srinivasa Rao Satti. Succinct ordinal trees based on tree covering. ACM Trans. Algorithms, 8(4):42:1-42:32, 2012. Google Scholar
  14. Meng He, J. Ian Munro, and Gelin Zhou. A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica, 70(4):696-717, 2014. Google Scholar
  15. Meng He, J. Ian Munro, and Gelin Zhou. Data Structures for Path Queries. ACM Trans. Algorithms, 12(4):53:1-53:32, 2016. Google Scholar
  16. Joseph JáJá, Christian Worm Mortensen, and Qingmin Shi. Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting. In ISAAC, pages 558-568, 2004. Google Scholar
  17. Danny Krizanc, Pat Morin, and Michiel H. M. Smid. Range Mode and Range Median Queries on Lists and Trees. Nord. J. Comput., 12(1):1-17, 2005. Google Scholar
  18. Christos Makris and Athanasios K. Tsakalidis. Algorithms for Three-Dimensional Dominance Searching in Linear Space. Inf. Process. Lett., 66(6):277-283, 1998. Google Scholar
  19. Yakov Nekrich. A data structure for multi-dim. range reporting. In SoCG, pages 344-353, 2007. Google Scholar
  20. Yakov Nekrich and Gonzalo Navarro. Sorted Range Reporting. In SWAT, pages 271-282, 2012. Google Scholar
  21. Manish Patil, Rahul Shah, and Sharma V. Thankachan. Succinct representations of weighted trees supporting path queries. J. Discrete Algorithms, 17:103-108, 2012. Google Scholar
  22. Dan E. Willard. Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). Inf. Process. Lett., 17(2):81-84, 1983. Google Scholar
  23. Gelin Zhou. Two-dimensional range successor in optimal time and almost linear space. Inf. Process. Lett., 116(2):171-174, 2016. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail