958 search results - page 11 / 192 » Efficient data structures for range-aggregate queries on tre... |
DEXAW
2004
IEEE
13 years 11 months ago
2004
IEEE
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among ...
ICDE
2002
IEEE
14 years 8 months ago
2002
IEEE
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
INFOSCALE
2007
ACM
13 years 9 months ago
2007
ACM
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...