Sciweavers

294 search results - page 25 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
CIDR
2007
100views Algorithms» more  CIDR 2007»
15 years 7 months ago
Database Cracking
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
PODS
2002
ACM
98views Database» more  PODS 2002»
16 years 6 months ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
ICDE
1995
IEEE
99views Database» more  ICDE 1995»
16 years 7 months ago
Record Subtyping in Flexible Relations by Means of Attribute Dependencies
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...
Christian Kalus, Peter Dadam
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
16 years 6 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 7 months ago
Optimizing SQL Queries over Text Databases
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
Alpa Jain, AnHai Doan, Luis Gravano