Sciweavers

327 search results - page 31 / 66
» XML Tree Structure Compression
Sort
View
SBBD
2007
149views Database» more  SBBD 2007»
13 years 9 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
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
14 years 4 days ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
DKE
2006
139views more  DKE 2006»
13 years 7 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 8 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
ICMCS
2005
IEEE
116views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Lossless image compression with tree coding of magnitude levels
With the rapid development of digital technology in consumer electronics, the demand to preserve raw image data for further editing or repeated compression is increasing. Traditio...
Hua Cai, Jiang Li