... The projected query cost is computed by first building a query tree, and then intersecting the query tree with a pre-constructed multi-dimensional index tree (Kunszt et al. 2000, this volume). ...
... The number of levels in the tree is determined by maximizing the number of objects in a leaf node (container) with the constraint that the k \Gamma d tree must be small enough to reside in the memory of the user's computer. ...
... Next: A Multidimensional Binary Search Tree for Star Catalog Correlations . Up: Astrostatistics and Databases . ... A tree of resources can be browsed and desired resources selected. ...
... References for Galaxy Clusters Database . M. Kalinkov, I. A. Valtchanov, and I. Kuneva . R-Trees for Astronomical Data Indexing . A. Baruffolo . ...
... B-tree index to support astronomical coordinates, and to implement a two dimensional ... of various sizes indexed using B-Trees (dashed line) and R-Trees (solid line ... indexed on coordinates using both B-Trees and R-Trees, and a series of tests were ...
... An octree is a tree-structured representation that can be used to describe a set of ... sub-cubes, starting at a single large cube represented by the root-node in the tree ...
... trees attempt to overcome the disadvantage of axis-parallel trees by allowing the ... trees are considerably more difficult to construct than axis-parallel trees because ...