921 search results - page 9 / 185 » New Data Structures for Orthogonal Range Searching |
ESA
2010
Springer
13 years 11 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
CVDB
2004
ACM
14 years 3 months ago
2004
ACM
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...
WADS
2007
Springer
14 years 3 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
ICSE
2008
IEEE-ACM
14 years 10 months ago
2008
IEEE-ACM
This paper describes Juzi, a tool for automatic repair of complex data structures. Juzi takes a Java class representing the data structure as well as a predicate method that speci...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...