Abstract
No public abstract is available from the verified source records.
Alberto Belussi
Abstract
Authors
Institutions
Provenance
crossref
Confidence 100%
openalex
Confidence 95%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
No local citing links have been materialized yet.
Optimization strategies for spatial query processing
1991
An optimal algorithm for approximating nearest neighbor searching
1994
The R*_-tree: an efficient and robust access method for point and rectangles
1990
A data access structure for filtering distance queries in image retrieval
1996
Optimal expected-time algorithms for closest point problems
10.1145/355921.355927 · 1980
On packing R-trees
1993
Fractals for secondary key retrieval
1989
Unresolved referenced work
1992
An algorithm for finding the best matches in logarithmic expected time
10.1145/355744.355745 · 1977
Multidimensional access methods
10.1145/280277.280279 · 1998
Short algorithms for space-filling curves
10.1002/spe.4380110106 · 1981
R-tree: a dynamic index structure for spatial searching
1984
Ranking in spatial databases
1995
Efficient processing of spatial queries in line segment databases
1991
An access method based query processor for spatial database systems
1991
Efficient spatial query processing in geographic database systems
1993
Spatial indexing: past and future
1993
Unresolved referenced work
1966
The grid file: an adaptable, symmetric multikey file structure
10.1145/348.318586 · 1984
Spatial query processing in an object-oriented database system
1986
Redundancy in spatial databases
1989
Corner stitching. A data structuring technique for VLSI layout tools
1984
The magic VLSI layout system
10.1109/mdt.1985.294681 · 1985
Nearest neighbor queries
1995
Unresolved referenced work
1989
Unresolved referenced work
1990
The R+-tree: a dynamic index for multi-dimensional objects
1997
No additional external references are available.