25 search results - page 1 / 5 » Hashing by Proximity to Process Duplicates in Spatial Databa... |
CIKM
1994
Springer
13 years 8 months ago
1994
Springer
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
ICDE
2000
IEEE
14 years 5 months ago
2000
IEEE
CVPR
2012
IEEE
11 years 6 months ago
2012
IEEE
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
VLDB
1998
ACM
13 years 8 months ago
1998
ACM
The query execution engine in Microsoft SQL Server employs hash-based algorithms for inner and outer joins, semi-joins, set operations (such as intersection), grouping, and duplic...
ICDE
1987
IEEE
13 years 8 months ago
1987
IEEE
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...