552 search results - page 21 / 111 » Efficient Algorithms for Processing XPath Queries |
151
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
104
click to vote
CIKM
2004
Springer
15 years 1 months ago
2004
Springer
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
191
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
117
click to vote
EDBT
2009
ACM
14 years 7 months ago
2009
ACM
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
183
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...