Sciweavers

502 search results - page 47 / 101
» Verifying Balanced Trees
Sort
View
DANTE
1999
IEEE
149views Database» more  DANTE 1999»
14 years 2 months ago
Parallel R-Tree Spatial Join for a Shared-Nothing Architecture
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This...
Lawrence Mutenda, Masaru Kitsuregawa
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 10 months ago
Symmetric M-tree
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To date, no algorithm has been published for the corresp...
Alan P. Sexton, Richard Swinbank
CG
2006
Springer
13 years 10 months ago
Interruptible collision detection for deformable objects
This paper presents an approach to performing time-critical collision detection for deformable objects. The deformable objects are represented by dense meshes and their deformatio...
César Mendoza, Carol O'Sullivan
SSD
2005
Springer
185views Database» more  SSD 2005»
14 years 3 months ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 11 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...