303 search results - page 16 / 61 » Using a compact tree to index and query XML data |
TDM
2004
13 years 8 months ago
2004
To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great pote...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...