Sciweavers

65 search results - page 9 / 13
» Ctree: a compact tree for indexing XML data
Sort
View
TCS
2008
14 years 9 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
15 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
SBBD
2007
149views Database» more  SBBD 2007»
14 years 11 months ago
Embedding Similarity Joins into Native XML Databases
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such ...
Leonardo Ribeiro, Theo Härder
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
15 years 9 months ago
Covering indexes for branching path queries
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...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
15 years 3 months ago
Efficient Processing of Updates in Dynamic XML Data
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
Changqing Li, Tok Wang Ling, Min Hu