Sciweavers

777 search results - page 67 / 156
» Optimization of Relational Preference Queries
Sort
View
ICDE
1997
IEEE
133views Database» more  ICDE 1997»
14 years 11 months ago
Physical Database Design for Data Warehouses
Data warehouses collect copies of information from remote sources into a single database. Since the remote data is cached at the warehouse, it appears as local relations to the us...
Wilburt Labio, Dallan Quass, Brad Adelberg
WWW
2008
ACM
14 years 10 months ago
Learning to rank relational objects and its application to web search
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 10 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
13 years 7 months ago
Perm: Processing Provenance and Data on the Same Data Model through Query Rewriting
Data provenance is information that describes how a given data item was produced. The provenance includes source and intermediate data as well as the transformations involved in pr...
Boris Glavic, Gustavo Alonso
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
14 years 2 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...