✦ LIBER ✦

The RS-tree: An efficient data structure for distance browsing queries

✍ Scribed by Dong-Joo Park; Shin Heu; Hyoung-Joo Kim

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 167 KB
Volume: 80
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00163-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Method for Version Control

An Efficient Method for Version Control of a Tree Data Structure

✍ ESTHER JINEE CHOI; YONG RAE KWON 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

A new method for version controlling of a tree structure is presented. The key feature of the method is that the latest state of a tree is retained and other versions are constructed from it on request, and information on the change history of a node is maintaind in its parent node. Several algorith

Linearized Suffix Tree: an Efficient Ind

Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and

✍ Dong Kyue Kim; Minhwan Kim; Heejin Park 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 777 KB

An efficient data structure for the adva

An efficient data structure for the advancing-front triangular mesh generation technique

✍ Kwok, W. ;Haghighi, K. ;Kang, E. 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 459 KB

An efficient algorithm for nucleation st

An efficient algorithm for nucleation studies of particles using the octree data structure

✍ Bruce B. Lowekamp; John C. Schug 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

An efficient algorithm is described for studying the nucleation properties of particles with short-range potential using Monte Carlo simulation. The hierarchical division method, implemented through an octree structure in which we repeatedly decompose the simulation cube into eight sub-cubes, is use