327 search results - page 51 / 66 » XML Tree Structure Compression |
SBBD
2004
14 years 11 months ago
2004
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
EDBT
2002
ACM
15 years 9 months ago
2002
ACM
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
120
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...
SPIRE
2009
Springer
15 years 4 months ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
172
Voted
POPL
2005
ACM
15 years 10 months ago
2005
ACM
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...