Sciweavers

777 search results - page 94 / 156
» Optimization of Relational Preference Queries
Sort
View
220
Voted
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 3 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
125
Voted
PODS
1999
ACM
133views Database» more  PODS 1999»
15 years 7 months ago
Processing and Optimization of Multiway Spatial Joins Using R-Trees
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
Dimitris Papadias, Nikos Mamoulis, Yannis Theodori...
121
Voted
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
16 years 2 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, ...
125
Voted
WLP
2000
Springer
15 years 6 months ago
A Dynamic Approach to Deductive Query Evaluation
In this paper, a dynamic approach to deductive query evaluation is presented which combines the e ects of di erent SIP strategies used for the magic set rewriting technique. Given...
Andreas Behrend
135
Voted
ER
2008
Springer
110views Database» more  ER 2008»
15 years 4 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi