We consider the problems of finding and determining certain query answers and of determining containment between queries; each problem is formulated in presence of materialized views and dependencies under the closed-world assumption. We show a tight relationship between the problems in this setting. Further, we introduce algorithms for solving each problem for those inputs where all the queries and views are conjunctive, and the dependencies are embedded weakly acyclic. We also determine the complexity of each problem under the security-relevant complexity measure introduced by Zhang and Mendelzon in 2005. The problems studied in this paper are fundamental in ensuring correct specification of database access-control policies, in particular in case of fine-grained access control. Our approaches can also be applied in the areas of inference control, secure data publishing, and database auditing.
The Brodsky paper @cite_25 (NB! it actually precedes [was published in the year 2000] the paper @cite_24 , which was published in 2005):
@cite_24 @cite_25
2029538739 2088751297 2068557399 1511572470
This chapter reproduces the English translation by B. Seckler of the paper by Vapnik and Chervonenkis in which they gave proofs for the innovative results they had obtained in a draft form in July 1966 and announced in 1968 in their note in Soviet Mathematics Doklady. The paper was first published in Russian as Вапник В. Н. and Червоненкис А. Я. О равномерноЙ сходимости частот появления событиЙ к их вероятностям. Теория вероятностеЙ и ее применения 16(2), 264–279 (1971). This paper is a reprint of the original work by A. P. Calderon published by the Brazilian Mathematical Society (SBM) in ATAS of SBM (Rio de Janeiro), pp. 65-73, 1980. The original paper had no abstract, so this reprint to be truthful to the original work is published with no abstract. As part of the celebration of twenty-five years of ACM SIGIR conferences we performed a content analysis of all papers published in the proceedings of SIGIR conferences, including those from 2002. From this we determined, using information retrieval approaches of course, which topics had come and gone over the last two and a half decades, and which topics are currently "hot". We also performed a co-authorship analysis among authors of the 853 SIGIR conference papers to determine which author is the most "central" in terms of a co-authorship graph and is our equivalent of Paul Erdos in Mathematics. In the first section we report on the content analysis, leading to our prediction as to the most topical paper likely to appear at SIGIR2003. In the second section we present details of our co-authorship analysis, revealing who is the "Christopher Lee" of SIGIR, and in the final section we give pointers to where readers who are SIGIR conference paper authors may find details of where they fit into the coauthorship graph. This book studies the original results, and their extensions, of the Russian mathematician, S.A. Gersgorin, who wrote a seminal paper in 1931, on how to easily obtain estimates of all n eigenvalues (characteristic values) of any given n-by-n complex matrix. Since the publication of this paper, there has been many newer results spawned by his paper, and this book will be the first which is devoted solely to this resulting area. As such, it will include the latest research results, such as Brauer ovals of Cassini and Brualdi lemniscates, and their comparisons. This book is dedicated to the late Olga Taussky-Todd and her husband, John Todd. It was Olga who brought to light Gersgorin's paper and its significance to the mathematical world. The level of this book requires only a modest background in linear algebra and analysis, and is therefore comprehensible to upper-level and graduate level students in mathematics.