Page usage in a quadtree index | Zendy

Mamoru Hoshi | Zendy; Philippe Flajolet | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Page usage in a quadtree index

Author(s) -

Mamoru Hoshi,

Philippe Flajolet

Publication year - 1992

Publication title -

bit numerical mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.904

H-Index - 59

eISSN - 1572-9125

pISSN - 0006-3835

DOI - 10.1007/bf02074876

Subject(s) - quadtree , index (typography) , computer science , binary tree , data structure , tree (set theory) , occupancy , binary number , data mining , mathematics , algorithm , combinatorics , arithmetic , world wide web , programming language , engineering , architectural engineering

. This paper provides a characterization of the storage needs of a quadtreewhen used as an index to access large volumes of 2--dimensional data. It is shown thatthe page occupancy for data in random order approaches 33%. A precise mathematicalanalysis that involves a modicum of hypergeometric functions and dilogarithms,together with some computer algebra is presented.A brief survey of the analysis of storage usage in tree structures is included. The 33%ratio for quadtrees is to be...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research