Sciweavers

327 search results - page 28 / 66
» XML Tree Structure Compression
Sort
View
IEEESCC
2009
IEEE
13 years 5 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
ICIP
1998
IEEE
14 years 9 months ago
A Compressed Video Database Structured for Active Browsing and Search
We describe a unique system called ViBE (video browsing environment) for browsing and searching large databases of video sequences. The system first computes the DC sequence for a...
Cüneyt M. Taskiran, Charles A. Bouman, Edward...
CIKM
2008
Springer
13 years 9 months ago
Structural relevance: a common basis for the evaluation of structured document retrieval
This paper presents a unified framework for the evaluation of a range of structured document retrieval (SDR) approaches and tasks. The framework is based on a model of tree retrie...
Mir Sadek Ali, Mariano P. Consens, Gabriella Kazai...
ICDE
2002
IEEE
153views Database» more  ICDE 2002»
14 years 9 months ago
From XML Schema to Relations: A Cost-Based Approach to XML Storage
As Web applications manipulate an increasing amount of XML, there is a growing interest in storing XML data in relational databases. Due to the mismatch between the complexity of ...
Jérôme Siméon, Juliana Freire,...
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 2 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer