Sciweavers

327 search results - page 47 / 66
» XML Tree Structure Compression
Sort
View
CORR
2007
Springer
140views Education» more  CORR 2007»
13 years 7 months ago
From the entropy to the statistical structure of spike trains
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
Yun Gao, Ioannis Kontoyiannis, Elie Bienenstock
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
14 years 22 hour ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
WWW
2007
ACM
14 years 8 months ago
Using d-gap patterns for index compression
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
Jinlin Chen, Terry Cook
DEBU
2008
125views more  DEBU 2008»
13 years 7 months ago
Querying XML in Timber
In this paper, we describe the TIMBER XML database system implemented at University of Michigan. TIMBER was one of the first native XML database systems, designed from the ground ...
Yuqing Wu, Stelios Paparizos, H. V. Jagadish
EDBT
2002
ACM
179views Database» more  EDBT 2002»
14 years 8 months ago
Efficient Complex Query Support for Multiversion XML Documents
Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML ...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo,...