A formula for computing the number of quadtree node fragments created by a shift
Pattern Recognition Letters
Redundancy in spatial databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A retrieval technique for similar shapes
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Analytical results on the quadtree decomposition of arbitrary rectangles
Pattern Recognition Letters
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An effective way to represent quadtrees
Communications of the ACM
Computer Vision
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles
IEEE Transactions on Knowledge and Data Engineering
PROBE Spatial Data Modeling and Query Processing in an Image Database Application
IEEE Transactions on Software Engineering
QBISM: Extending a DBMS to Support 3D Medical Images
Proceedings of the Tenth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Optimal Redundancy in Spatial Database Systems
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Nearest neighbor queries in metric spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Selectivity estimation of Window queries for line segment datasets
Proceedings of the seventh international conference on Information and knowledge management
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
A Raster Approximation For Processing of Spatial Joins
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Spatial indexing of high-dimensional data based on relative approximation
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |