552 search results - page 16 / 111 » Efficient Algorithms for Processing XPath Queries |
DEBS
2010
ACM
14 years 4 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
100
click to vote
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
148
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most ...
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...