127 search results - page 17 / 26 » XQzip: Querying Compressed XML Using Structural Indexing |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
TKDE
2012
11 years 10 months ago
2012
—In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has l...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...