Sciweavers

303 search results - page 48 / 61
» Using a compact tree to index and query XML data
Sort
View
211
Voted
ICDE
2009
IEEE
148views Database» more  ICDE 2009»
16 years 1 months ago
Online Interval Skyline Queries on Time Series
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...
Bin Jiang, Jian Pei
95
Voted
SPIRE
2009
Springer
15 years 6 months ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...
90
Voted
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
14 years 11 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
101
Voted
CIKM
2006
Springer
15 years 3 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
120
Voted
PVLDB
2008
128views more  PVLDB 2008»
14 years 11 months ago
Implementing filesystems by tree-aware DBMSs
With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learn...
Alexander Holupirek, Marc H. Scholl