Sciweavers

327 search results - page 3 / 66
» XML Tree Structure Compression
Sort
View
ADBIS
2006
Springer
103views Database» more  ADBIS 2006»
14 years 20 days ago
RA: An XML Schema Reduction Algorithm
XML file comparison and clustering are two challenging tasks still accomplished predominantly manually. XML schema contains information about data structure, types, and labels fou...
Angela Cristina Duta, Ken Barker, Reda Alhajj
ICITA
2005
IEEE
14 years 8 days ago
Dynamic Markov Compression Using a Crossbar-Like Tree Initial Structure for Chinese Texts
This paper proposes the use of a crossbar-like tree structure to use with Dynamic Markov Compression (DMC) for the compression of Chinese text files. DMC had previously been found...
Ghim Hwee Ong, Jun-Ping Ng
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 6 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
MSV
2004
13 years 8 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 6 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu