Sciweavers

2514 search results - page 364 / 503
» On the Computation of Approximations of Database Queries
Sort
View
EDBT
2006
ACM
129views Database» more  EDBT 2006»
16 years 7 months ago
Efficient Quantile Retrieval on Multi-dimensional Data
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Man Lung Yiu, Nikos Mamoulis, Yufei Tao
SAC
2006
ACM
16 years 25 days ago
Grouping and aggregation in the concept-oriented data model
In the paper we describe the problem of grouping and aggregation in the concept-oriented data model. The model is based on ordering its elements within a hierarchical multidimensi...
Alexandr A. Savinov
SAC
2006
ACM
16 years 25 days ago
Schemes for SR-Tree packing
Modern database applications like geographic information systems, multimedia databases, and digital libraries dealing with huge volumes of high dimensional data, make use of multi...
Jayendra Venkateswaran, S. R. Subramanya
174
Voted
FOCS
2003
IEEE
16 years 4 days ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
219
Voted
SSDBM
1994
IEEE
153views Database» more  SSDBM 1994»
15 years 11 months ago
An Object-Oriented Data Model for a Time Series Management System
The analysis of time series is a central issue in economic research and many other scientific applications. However, the data management functionality for this field is not provid...
Werner Dreyer, Angelika Kotz Dittrich, Duri Schmid...