Results 1  10
of
955,424
Efficient Data Structures for RangeAggregate Queries on Trees ∗
"... Graphtheoretic 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 MIN in a query subtree consisting of the nodes reachable from a node u along paths of length ≤ k (u and k are query parame ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Graphtheoretic 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 MIN in a query subtree consisting of the nodes reachable from a node u along paths of length ≤ k (u and k are query
Effcient Execution of RangeAggregate Queries
, 2001
"... Rangeaggregate queries on the data cube are powerful tools for analysis in data warehouse environments. Cubetree is a technique materializing a data cube through an Rtree. It provides e#cient data accessibility, but involves some drawbacks to traverse all the internal and leaf nodes within giv ..."
Abstract
 Add to MetaCart
Rangeaggregate queries on the data cube are powerful tools for analysis in data warehouse environments. Cubetree is a technique materializing a data cube through an Rtree. It provides e#cient data accessibility, but involves some drawbacks to traverse all the internal and leaf nodes within
Efficient external memory structures for rangeaggregate queries
 COMPUTATIONAL GEOMETRY: THEORY AND APPLICATIONS
, 2013
"... ..."
Data Structures for RangeAggregate Extent Queries ✩
"... A fundamental and wellstudied problem in computational geometry is range searching, where the goal is to preprocess a set, S, of geometric objects (e.g., points in the plane) so that the subset S ′ ⊆ S that is contained in a query range (e.g., an axesparallel rectangle) can be reported efficientl ..."
Abstract
 Add to MetaCart
on a set of weights defined suitably on the objects. Such rangeaggregate query problems have been the subject of much recent research in both the database and the computational geometry communities. In this paper, we further generalize this line of work by considering aggregation functions on point
CRBtree: An efficient indexing scheme for rangeaggregate queries
 In Proc. International Conference on Database Theory
, 2003
"... Abstract. We propose a new indexing scheme, called the CRBtree, for efficiently answering rangeaggregate queries. The rangeaggregate problem is defined as follows: Given a set of weighted points in R d, compute the aggregate of weights of points that lie inside a ddimensional query rectangle. In ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Abstract. We propose a new indexing scheme, called the CRBtree, for efficiently answering rangeaggregate queries. The rangeaggregate problem is defined as follows: Given a set of weighted points in R d, compute the aggregate of weights of points that lie inside a ddimensional query rectangle
Approximating RangeAggregate Queries using Coresets
"... Let µ be a function that assigns a real number µ(P) ≥ 0 to any point set P in R d; for example, µ(P) can be the diameter or radius of the smallest enclosing ball of P. Let S be a set of n points in R d. We consider the problem of storing S in a data structure, such that for any query rectangle Q, w ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Let µ be a function that assigns a real number µ(P) ≥ 0 to any point set P in R d; for example, µ(P) can be the diameter or radius of the smallest enclosing ball of P. Let S be a set of n points in R d. We consider the problem of storing S in a data structure, such that for any query rectangle Q
The Lorel Query Language for Semistructured Data
 International Journal on Digital Libraries
, 1997
"... We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages are inapprop ..."
Abstract

Cited by 734 (29 self)
 Add to MetaCart
We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages
Efficient and Effective Querying by Image Content
 Journal of Intelligent Information Systems
, 1994
"... In the QBIC (Query By Image Content) project we are studying methods to query large online image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include med ..."
Abstract

Cited by 500 (13 self)
 Add to MetaCart
In the QBIC (Query By Image Content) project we are studying methods to query large online image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include
Tinydb: An acquisitional query processing system for sensor networks
 ACM Trans. Database Syst
, 2005
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract

Cited by 609 (8 self)
 Add to MetaCart
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs
Results 1  10
of
955,424