Sciweavers

109 search results - page 17 / 22
» Optimization Using Tuple Subsumption
Sort
View
ECCC
2011
282views ECommerce» more  ECCC 2011»
13 years 1 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
DLOG
2007
13 years 9 months ago
Speeding up Approximation with Nicer Concepts
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
Anni-Yasmin Turhan, Yusri Bong
ICDE
1998
IEEE
70views Database» more  ICDE 1998»
14 years 8 months ago
Point-Versus Interval-Based Temporal Data Models
The association of timestamps with various data items such as tuples or attribute values is fundamental to the management of time-varying information. Using intervals in timestamp...
Michael H. Böhlen, Renato Busatto, Christian ...
ER
2007
Springer
127views Database» more  ER 2007»
14 years 1 months ago
Generic Schema Mappings
Schema mappings come in different flavors: simple correspondences are produced by schema matchers, intensional mappings are used for schema integration. However, the execution of ...
David Kensche, Christoph Quix, Yong Li, Matthias J...
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
14 years 7 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...