958 search results - page 15 / 192 » Efficient data structures for range-aggregate queries on tre... |
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
ADBIS
2003
Springer
14 years 18 days ago
2003
Springer
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
IEICET
2008
13 years 7 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...