Sciweavers

2889 search results - page 144 / 578
» Querying Structured Hyperdocuments
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 9 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 8 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
VLDB
2001
ACM
129views Database» more  VLDB 2001»
14 years 18 days ago
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
Yasushi Sakurai, Masatoshi Yoshikawa, Ryoji Kataok...
EDBTW
2006
Springer
13 years 12 months ago
Pattern-Based Query Answering
Users without knowledge of schemas or structured query languages have difficulties in accessing information stored in databases. Commercial and research efforts have focused on key...
Alkis Simitsis, Georgia Koutrika
ADBIS
2001
Springer
107views Database» more  ADBIS 2001»
13 years 11 months ago
The Impact of Buffering on Closest Pairs Queries Using R-Trees
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...