114 search results - page 16 / 23 » Dynamic Spatial Approximation Trees for Massive Data |
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
EGH
2011
Springer
12 years 7 months ago
2011
Springer
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
EGH
2010
Springer
13 years 6 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
ICDE
1996
IEEE
14 years 9 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...