Sciweavers

1238 search results - page 71 / 248
» View-based query containment
Sort
View
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
15 years 10 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, ...
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
15 years 10 months ago
Querying Structured Text in an XML Database
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...
Shurug Al-Khalifa, Cong Yu, H. V. Jagadish
SIGMOD
2010
ACM
184views Database» more  SIGMOD 2010»
15 years 2 months ago
Load-balanced query dissemination in privacy-aware online communities
We propose a novel privacy-preserving distributed infrastructure in which data resides only with the publishers owning it. The infrastructure disseminates user queries to publishe...
Emiran Curtmola, Alin Deutsch, K. K. Ramakrishnan,...
ADBIS
2000
Springer
169views Database» more  ADBIS 2000»
15 years 2 months ago
Data Organization Issues for Location-Dependent Queries in Mobile Computing
We consider queries which originate from a mobile unit and whose result depends on the location of the user who initiates the query. Example of such a query is How many people are ...
Sanjay Kumar Madria, Bharat K. Bhargava, Evaggelia...
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
15 years 1 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang