Sciweavers

2514 search results - page 270 / 503
» On the Computation of Approximations of Database Queries
Sort
View
EDBT
2006
ACM
139views Database» more  EDBT 2006»
16 years 6 months ago
An Extensible, Distributed Simulation Environment for Peer Data Management Systems
Abstract. Peer Data Management Systems (PDMS) have recently attracted attention by the database community. One of the main challenges of this paradigm is the development and evalua...
Katja Hose, Andreas Job, Marcel Karnstedt, Kai-Uwe...
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 11 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
ICDT
1995
ACM
79views Database» more  ICDT 1995»
15 years 10 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta
GIS
2010
ACM
15 years 5 months ago
Scalable shortest paths browsing on land surface
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
Songhua Xing, Cyrus Shahabi
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
16 years 6 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...