552 search results - page 42 / 111 » Efficient Algorithms for Processing XPath Queries |
113
click to vote
PODS
2006
ACM
15 years 12 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
115
click to vote
EWSN
2004
Springer
15 years 11 months ago
2004
Springer
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
DOLAP
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, ...
ADBIS
1998
Springer
15 years 4 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
112
click to vote
PET
2010
Springer
15 years 1 months ago
2010
Springer
Mobile smartphone users frequently need to search for nearby points of interest from a location based service, but in a way that preserves the privacy of the users' locations...