Sciweavers

3020 search results - page 82 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
COMPGEOM
2003
ACM
15 years 11 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 6 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
ICDE
1999
IEEE
91views Database» more  ICDE 1999»
16 years 7 months ago
Real-Time Data Access Control on B-Tree Index Structures
This paper proposes methodologies to control the access of B-tree-indexed data in a batch and real-time fashion. Algorithms are proposed to insert, query, delete, and rebalance B-...
Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam
MTA
2010
175views more  MTA 2010»
15 years 4 months ago
Building a web-scale image similarity search system
As the number of digital images is growing fast and Content-based Image Retrieval (CBIR) is gaining in popularity, CBIR systems should leap towards Webscale datasets. In this paper...
Michal Batko, Fabrizio Falchi, Claudio Lucchese, D...
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
16 years 7 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...