Sciweavers

1888 search results - page 92 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
16 years 4 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
MOBIDE
2005
ACM
15 years 10 months ago
Context-aware optimization of continuous range queries maintenance for trajectories
This work addresses the problem of efficient maintenance of the (correct) answers to the continuous spatio-temporal range queries in Moving Objects Databases (MOD), which represen...
Goce Trajcevski, Hui Ding, Peter Scheuermann
143
Voted
PLDI
2004
ACM
15 years 10 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 8 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
AAAI
2004
15 years 6 months ago
Spatial Aggregation for Qualitative Assessment of Scientific Computations
Qualitative assessment of scientific computations is an emerging application area that applies a data-driven approach to characterize, at a high level, phenomena including conditi...
Chris Bailey-Kellogg, Naren Ramakrishnan