Sciweavers

19892 search results - page 11 / 3979
» The POSTGRES Data Model
Sort
View
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
14 years 7 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 4 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
14 years 4 months ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
14 years 2 months ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan
SIGMOD
1997
ACM
180views Database» more  SIGMOD 1997»
14 years 2 months ago
Online Aggregation
Aggregation in traditional database systems is performed in batch mode: a query is submitted, the system processes a large volume of data over a long period of time, and, eventual...
Joseph M. Hellerstein, Peter J. Haas, Helen J. Wan...