Sciweavers

1284 search results - page 14 / 257
» Data Structures for Mergeable Trees
Sort
View
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 7 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
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 8 months ago
The Haar+ Tree: A Refined Synopsis Data Structure
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
Panagiotis Karras, Nikos Mamoulis
WWW
2007
ACM
14 years 7 months ago
Mining contiguous sequential patterns from web logs
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tre...
Jinlin Chen, Terry Cook
LICS
2002
IEEE
13 years 11 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
INFOSCALE
2007
ACM
13 years 8 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou