148 search results - page 19 / 30 » Evaluation of Queries on Tree-Structured Data Using Dimensio... |
126
Voted
DOLAP
2000
ACM
15 years 7 months ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
267
click to vote
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
220
click to vote
GIS
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
140
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
122
click to vote
GRID
2007
Springer
15 years 6 months ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...