552 search results - page 28 / 111 » Efficient Algorithms for Processing XPath Queries |
101
click to vote
MDM
2010
Springer
15 years 1 months ago
2010
Springer
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
WWW
2005
ACM
16 years 13 days ago
2005
ACM
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
116
click to vote
WWW
2008
ACM
14 years 11 months ago
2008
ACM
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
101
click to vote
SIGMOD
1999
ACM
15 years 4 months ago
1999
ACM
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
107
Voted
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...