Sciweavers

373 search results - page 54 / 75
» The WebContent XML Store
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 1 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
WWW
2008
ACM
15 years 4 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
ICDE
2004
IEEE
90views Database» more  ICDE 2004»
16 years 5 months ago
Multiresolution Indexing of XML for Frequent Queries
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
Hao He, Jun Yang 0001
VLDB
2007
ACM
113views Database» more  VLDB 2007»
16 years 4 months ago
Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
Witold Litwin, Riad Mokadem, Philippe Rigaux, Thom...
CAISE
2005
Springer
15 years 10 months ago
Bridging Relational Databases to Context-Aware Services
The provision of context-aware services in terms of the anytime/anywhere/anymedia paradigm requires the consideration of certain context properties in terms of time, location, devi...
Elisabeth Kapsammer, Wieland Schwinger, Werner Ret...