Sciweavers

1381 search results - page 47 / 277
» Structural signatures for tree data structures
Sort
View
EDBT
2000
ACM
13 years 11 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
70
Voted
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 9 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
VLDB
1990
ACM
166views Database» more  VLDB 1990»
13 years 11 months ago
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
Divyakant Agrawal, Amr El Abbadi
JEA
2008
112views more  JEA 2008»
13 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
VMCAI
2010
Springer
14 years 5 months ago
Shape Analysis of Low-Level C with Overlapping Structures
Abstract. Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this r...
Jörg Kreiker, Helmut Seidl, Vesal Vojdani