Sciweavers

148 search results - page 19 / 30
» Evaluation of Queries on Tree-Structured Data Using Dimensio...
Sort
View
DOLAP
2000
ACM
13 years 12 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
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...
Lixin Fu, Joachim Hammer
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 9 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
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...
Man Lung Yiu, Nikos Mamoulis
GIS
2007
ACM
14 years 8 months ago
Proximity queries in large traffic networks
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 ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
14 years 2 months ago
PARINET: A tunable access method for in-network trajectories
— 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...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
GRID
2007
Springer
13 years 11 months ago
Optimizing multiple queries on scientific datasets with partial replicas
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...
Li Weng, Ümit V. Çatalyürek, Tahs...