DOCSLIB.ORG

Database Techniques for the World-Wide Web: a Survey

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Database Techniques for the World-Wide Web: a Survey Database Techniques for the World-Wide Web: A Survey Daniela Florescu Alon Levy Alb erto Mendelzon Inria Ro quencourt Univ. of Washington Univ. of Toronto dana@ro din.inria.fr [email protected] [email protected] Information extraction and integration: Certain web 1 Intro duction sites can b e viewed at a ner granularity level than pages, as containers of structured data e.g., sets of tuples, or The p opularity of the World-Wide Web WWW has made sets of ob jects. For example, the Internet Movie Database it a prime vehicle for disseminating information. The rel- http://www.imdb.com can b e viewed as a front end in- evance of database concepts to the problems of managing terface to a database ab out movies. Given the rise in the and querying this information has led to a signi cant body numb er of such sites, there are two tasks we consider. The of recent research addressing these problems. Even though rst task is to actually extract a structured representation the underlying challenge is the one that has b een tradition- of the data e.g., a set of tuples from the HTML pages ally addressed by the database community{how to manage containing them. This task is p erformed by a set of wrap- large volumes of data { the novel context of the WWW forces per programs, whose creation and maintenance raises several us to signi cantl y extend previous techniques. The primary challenges. Once we view these sites as autonomous hetero- goal of this survey is to classify the di erent tasks to which geneous databases, we can address the second task of p osing database concepts have b een applied, and to emphasize the queries that require the integration of data. The second task technical innovations that were required to do so. is addressed by mediator or data integration systems. We do not claim that database technology is the magic bullet Web site construction and restructuring: A di er- that will solve all web information management problems; ent asp ect in which database concepts and technology can other technologies, such as Information Retrieval, Arti cial b e applied is that of buildin g, restructuring and managing Intelligence, and Hyp ertext/Hyp ermedia, are likely to b e web-sites. In contrast to the previous two classes which ap- just as imp ortant. However, surveying all the work going ply on existing web sites, here we consider the pro cess of on in these areas, and the interactions b etween them and creating sites. Web sites can b e constructed either by start- database ideas, would b e far b eyond our scop e. ing with some raw data stored in databases or structured We fo cus on three classes of tasks related to information les or by restructuring existing web sites. Peforming this management on the WWW. task requires metho ds for modeling the structure of web site and languages for restructing data to conform to a desired Mo deling and querying the web: Supp ose we view the structure. web as a directed graph whose no des are web pages and whose edges are the links b etween pages. A rst task we Before we b egin, we note that there are several topics con- consider is that of formulating queries for retrieving certain cerning the application of database concepts to the WWW pages on the web. The queries can b e based on the content which are not covered in this survey, such as caching and of the desired pages and on the link structure connecting the replication see [WWW98 , GRC97 ] for recentworks, trans- pages. The simplest instance of this task, which is provided action pro cessing and securityinweb environments see by search engines on the web is to lo cate pages based on the e.g. [Bil98 ], p erformance, availabil ity and scalability issues words they contain. A simple generalizatio n of such a query for web servers e.g. [CS98], or indexing techniques and is to apply more complex predicates on the contents of a crawler technology e.g. [CGMP98]. Furthermore, this page e.g., nd the pages that contain the word \Clinton" is not meant to b e a survey on existing pro ducts even in next to a link to an image. Finally, as an example of a query the areas on whichwe do fo cus. Finally, there are several that involves the structure of the pages, consider the query tangential areas whose results are applicabl e to the systems asking for all images reachable from the ro ot of the CNN web we discuss, but we do not cover them here. Examples of site within 5 links. The last typ e of queries are esp ecially such elds include systems for managing do cument collec- useful when detecting violations of integrity constraints on + tions and ranking of do cuments e.g., Harvest [BDH 95], aweb site or a collection of web sites. Gloss [GGMT99] and exible query answering systems [BT98]. Finally, the eld of web/db is a very dynamic one; hence, there are undoubtedly some omissions in our coverage, for whichwe ap ologize in advance. The survey is organized as follows. We b egin in Section 2 by discussing the main issues that arise in designing data mo d- els for web/db applications . The following three sections consider each of the aforementioned tasks. Section 6 con- attributes. Because of the characteristics of semistructured cludes with p ersp ectives and directions for future research. data mentioned ab ove, an additional feature that b ecomes imp ortant in this context is the ability to query the schema i.e., the lab els on the arcs in the graph. This feature is 2 Data Representation for Web/DB Tasks supp orted in languages for querying semistructured data by arc variables which get b ound to lab els on arcs, rather than Building systems for solving any of the previous tasks re- no des in the graph. quires that wecho ose a metho d for mo deling the underlying domain. In particular, in these tasks, we need to mo del the In addition to developing mo dels and query languages for web itself, structure of web sites, internal structure of web semistructured data, there has b een considerable recentwork pages, and nally, contents of web sites in ner granulariti es. on issues concerning the management of semistructured data, In this section we discuss the main distinguishi ng factors of such as the extraction of structure from semistructured data + the data mo dels used in web applicatio ns. [NAM98], view maintenance [ZGM98 , AMR 98], summa- rization of semistructured data [BDFS97, GW97 ], and rea- Graph data mo dels: As noted ab ove, several of the ap- soning ab out semistructured data [CGL98, FFLS98 ]. Aside plications we discuss require to mo del the set of web pages from the relevance of these works to the tasks mentioned in and the links b etween them. These pages can either b e on this survey, the systems based on these metho ds will b e of several sites or within a single site. Hence, a natural way sp ecial imp ortance for the task of managing large volumes to mo del this data is based on a labeledgraph data mo del. of XML data [XML98]. Sp eci call y, in this mo del, no des representweb pages or internal comp onents of web pages, and arcs represent links Other characteristics of web data mo dels: Another between pages. The lab els on the arcs can b e viewed as at- distinguish in g characteristic of mo dels used in web/db ap- tribute names. Along with the lab eled graph mo del, several plications is the presence of web-sp eci c constructs in the query languages have b een develop ed. One central feature data representation. For example, some mo dels distinguish that is common to these query languages is the abilityto a unary relation identifying pages and a binary relation for formulate regular path expression queries over the graph. links b etween pages. Furthermore, wemay distinguish b e- Regular path expressions enable p osing navigational queries tween links within a web site and external links. An im- over the graph structure. p ortant reason to distingui sh a link relation is that it can generally only b e traversed in the forward direction. Addi- Semistructured data mo dels: The second asp ect of mo d- tional second order dimensions along which the data mo dels eling data for web applicatio ns is that in many cases the we discuss di er are 1 the ability to mo del order among structure of the data is irregular. Sp eci call y, when mo del- elements in the database, 2 mo deling nested data struc- ing the structure of a web site, we don't have a xed schema tures, and 3 supp ort for collection typ es sets, bags, ar- whichisgiven in advance. When mo deling data coming from rays. An example of a data mo del that incorp orates explicit multiple sources, the representation of some attributes e.g., web-sp eci c constructs pages and page schemes, nesting, addresses may di er from source to source. Hence, several and collection typ es is ADM, the data mo del of the Ara- pro jects have considered mo dels of semistructured data. The neus pro ject [AMM97b]. We remark that all the mo dels we initial motivation for this work was the existence and rela- mention in this pap er represent only static structures.
Load more

Recommended publications
  • Understanding the Hidden Web
    Introduction General Framework Different Modules Conclusion Understanding the Hidden Web Pierre Senellart Athens University of Economics & Business, 28 July 2008 Introduction General Framework Different Modules Conclusion Simple problem Contact all co-authors of Serge Abiteboul. It’s easy! You just need to: Find all co-authors. For each of them, find their current email address. Introduction General Framework Different Modules Conclusion Advanced Scholar Search Advanced Search Tips | About Google Scholar Find articles with all of the words with the exact phrase with at least one of the words without the words where my words occur Author Return articles written by e.g., "PJ Hayes" or McCarthy Publication Return articles published in e.g., J Biol Chem or Nature Date Return articles published between — e.g., 1996 Subject Areas Return articles in all subject areas. Return only articles in the following subject areas: Biology, Life Sciences, and Environmental Science Business, Administration, Finance, and Economics Chemistry and Materials Science Engineering, Computer Science, and Mathematics Medicine, Pharmacology, and Veterinary Science Physics, Astronomy, and Planetary Science Social Sciences, Arts, and Humanities ©2007 Google Introduction General Framework Different Modules Conclusion Advanced Scholar Search Advanced Search Tips | About Google Scholar Find articles with all of the words with the exact phrase with at least one of the words without the words where my words occur Author Return articles written by e.g., "PJ Hayes" or McCarthy Publication
    [Show full text]
  • The Best Nurturers in Computer Science Research
    The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.
    [Show full text]
  • Essays Dedicated to Peter Buneman ; [Colloquim in Celebration
    Val Tannen Limsoon Wong Leonid Libkin Wenfei Fan Wang-Chiew Tan Michael Fourman (Eds.) In Search of Elegance in the Theory and Practice of Computation Essays Dedicated to Peter Buneman 4^1 Springer Table of Contents Models for Data-Centric Workflows 1 Serge Abiteboul and Victor Vianu Relational Databases and Bell's Theorem 13 Samson Abramsky High-Level Rules for Integration and Analysis of Data: New Challenges 36 Bogdan Alexe, Douglas Burdick, Mauricio A. Hernandez, Georgia Koutrika, Rajasekar Krishnamurthy, Lucian Popa, Ioana R. Stanoi, and Ryan Wisnesky A New Framework for Designing Schema Mappings 56 Bogdan Alexe and Wang-Chiew Tan User Trust and Judgments in a Curated Database with Explicit Provenance 89 David W. Archer, Lois M.L. Delcambre, and David Maier An Abstract, Reusable, and Extensible Programming Language Design Architecture 112 Hassan Ait-Kaci A Discussion on Pricing Relational Data 167 Magdalena Balazinska, Bill Howe, Paraschos Koutris, Dan Suciu, and Prasang Upadhyaya Tractable Reasoning in Description Logics with Functionality Constraints 174 Andrea Call, Georg Gottlob, and Andreas Pieris Toward a Theory of Self-explaining Computation 193 James Cheney, Umut A. Acar, and Roly Perera To Show or Not to Show in Workflow Provenance 217 Susan B. Davidson, Sanjeev Khanna, and Tova Milo Provenance-Directed Chase&Backchase 227 Alin Deutsch and Richard Hull Data Quality Problems beyond Consistency and Deduplication 237 Wenfei Fan, Floris Geerts, Shuai Ma, Nan Tang, and Wenyuan Yu X Table of Contents 250 Hitting Buneman Circles Michael Paul Fourman 259 Looking at the World Thru Colored Glasses Floris Geerts, Anastasios Kementsietsidis, and Heiko Muller Static Analysis and Query Answering for Incomplete Data Trees with Constraints 273 Amelie Gheerbrant, Leonid Libkin, and Juan Reutter Using SQL for Efficient Generation and Querying of Provenance Information 291 Boris Glavic, Renee J.
    [Show full text]
  • INF2032 2017-2 Tpicos Em Bancos De Dados III ”Foundations of Databases”
    INF2032 2017-2 Tpicos em Bancos de Dados III "Foundations of Databases" Profs. Srgio Lifschitz and Edward Hermann Haeusler August-December 2017 1 Motivation The motivation of this course is to put together theory and practice of database and knowledge base systems. The main content includes a formal approach for the underlying existing technology from the point of view of logical expres- siveness and computational complexity. New and recent database models and systems are discussed from theory to practical issues. 2 Goal of the course The main goal is to introduce the student to the logical and computational foundations of database systems. 3 Sylabus The course in divided in two parts: Classical part: relational database model 1. Revision and formalization of relational databases. Limits of the relational data model; 2. Relational query languages; DataLog and recursion; 3. Logic: Propositional, First-Order, Higher-Order, Second-Order, Fixed points logics; 4. Computational complexity and expressiveness of database query lan- guages; New approaches for database logical models 1. XML-based models, Monadic Second-Order Logic, XPath and XQuery; 2. RDF-based knowledge bases; 3. Decidable Fragments of First-Order logic, Description Logic, OWL dialects; 4. NoSQL and NewSQL databases; 4 Evaluation The evaluation will be based on homework assignments (70 %) and a research manuscript + seminar (30%). 5 Supporting material Lecture notes, slides and articles. Referenced books are freely available online. More details at a wiki-based web page (available from August 7th on) References [ABS00] Serge Abiteboul, Peter Buneman, and Dan Suciu. Data on the Web: From Relations to Semistructured Data and XML.
    [Show full text]
  • Author Template for Journal Articles
    Mining citation information from CiteSeer data Dalibor Fiala University of West Bohemia, Univerzitní 8, 30614 Plzeň, Czech Republic Phone: 00420 377 63 24 29, fax: 00420 377 63 24 01, email: [email protected] Abstract: The CiteSeer digital library is a useful source of bibliographic information. It allows for retrieving citations, co-authorships, addresses, and affiliations of authors and publications. In spite of this, it has been relatively rarely used for automated citation analyses. This article describes our findings after extensively mining from the CiteSeer data. We explored citations between authors and determined rankings of influential scientists using various evaluation methods including cita- tion and in-degree counts, HITS, PageRank, and its variations based on both the citation and colla- boration graphs. We compare the resulting rankings with lists of computer science award winners and find out that award recipients are almost always ranked high. We conclude that CiteSeer is a valuable, yet not fully appreciated, repository of citation data and is appropriate for testing novel bibliometric methods. Keywords: CiteSeer, citation analysis, rankings, evaluation. Introduction Data from CiteSeer have been surprisingly little explored in the scientometric lite- rature. One of the reasons for this may have been fears that the data gathered in an automated way from the Web are inaccurate – incomplete, erroneous, ambiguous, redundant, or simply wrong. Also, the uncontrolled and decentralized nature of the Web is said to simplify manipulating and biasing Web-based publication and citation metrics. However, there have been a few attempts at processing the Cite- Seer data which we will briefly mention. Zhou et al.
    [Show full text]
  • Data on the Web: from Relations to Semistructured Data and XML
    Data on the Web: From Relations to Semistructured Data and XML Serge Abiteboul Peter Buneman Dan Suciu February 19, 2014 1 Data on the Web: from Relations to Semistructured Data and XML Serge Abiteboul Peter Buneman Dan Suciu An initial draft of part of the book Not for distribution 2 Contents 1 Introduction 7 1.1 Audience . 8 1.2 Web Data and the Two Cultures . 9 1.3 Organization . 15 I Data Model 17 2 A Syntax for Data 19 2.1 Base types . 21 2.2 Representing Relational Databases . 21 2.3 Representing Object Databases . 22 2.4 Specification of syntax . 26 2.5 The Object Exchange Model, OEM . 26 2.6 Object databases . 27 2.7 Other representations . 30 2.7.1 ACeDB . 30 2.8 Terminology . 32 2.9 Bibliographic Remarks . 34 3 XML 37 3.1 Basic syntax . 39 3.1.1 XML Elements . 39 3.1.2 XML Attributes . 41 3.1.3 Well-Formed XML Documents . 42 3.2 XML and Semistructured Data . 42 3.2.1 XML Graph Model . 43 3.2.2 XML References . 44 3 4 CONTENTS 3.2.3 Order . 46 3.2.4 Mixing elements and text . 47 3.2.5 Other XML Constructs . 47 3.3 Document Type Declarations . 48 3.3.1 A Simple DTD . 49 3.3.2 DTD's as Grammars . 49 3.3.3 DTD's as Schemas . 50 3.3.4 Declaring Attributes in DTDs . 52 3.3.5 Valid XML Documents . 54 3.3.6 Limitations of DTD's as schemas .
    [Show full text]
  • O. Peter Buneman Curriculum Vitæ – Jan 2008
    O. Peter Buneman Curriculum Vitæ { Jan 2008 Work Address: LFCS, School of Informatics University of Edinburgh Crichton Street Edinburgh EH8 9LE Scotland Tel: +44 131 650 5133 Fax: +44 667 7209 Email: [email protected] or [email protected] Home Address: 14 Gayfield Square Edinburgh EH1 3NX Tel: 0131 557 0965 Academic record 2004-present Research Director, Digital Curation Centre 2002-present Adjunct Professor of Computer Science, Department of Computer and Information Science, University of Pennsylvania. 2002-present Professor of Database Systems, Laboratory for the Foundations of Computer Science, School of Informatics, University of Edinburgh 1990-2001 Professor of Computer Science, Department of Computer and Information Science, University of Pennsylvania. 1981-1989 Associate Professor of Computer Science, Department of Computer and Information Science, University of Pennsylvania. 1981-1987 Graduate Chairman, Department of Computer and Information Science, University of Pennsyl- vania 1975-1981 Assistant Professor of Computer Science at the Moore School and Assistant Professor of Decision Sciences at the Wharton School, University of Pennsylvania. 1969-1974 Research Associate and subsequently Lecturer in the School of Artificial Intelligence, Edinburgh University. Education 1970 PhD in Mathematics, University of Warwick (Supervisor E.C. Zeeman) 1966 MA in Mathematics, Cambridge. 1963-1966 Major Scholar in Mathematics at Gonville and Caius College, Cambridge. Awards, Visting positions Distinguished Visitor, University of Auckland, 2006 Trustee, VLDB Endowment, 2004 Fellow of the Royal Society of Edinburgh, 2004 Royal Society Wolfson Merit Award, 2002 ACM Fellow, 1999. 1 Visiting Resarcher, INRIA, Jan 1999 Visiting Research Fellowship sponsored by the Japan Society for the Promotion of Science, Research Institute for the Mathematical Sciences, Kyoto University, Spring 1997.
    [Show full text]
  • SIGMOD Record’S Series of Interviews with Distinguished Members of the Database Community
    Serge Abiteboul Speaks Out on Building a Research Group in Europe, How He Got Involved in a Startup, Why Systems Papers Shouldn’t Have to Include Measurements, the Value of Object Databases, and More by Marianne Winslett http://www-rocq.inria.fr/~abitebou/ Welcome to this installment of ACM SIGMOD Record’s series of interviews with distinguished members of the database community. I’m Marianne Winslett, and today we are at the SIGMOD 2006 conference in Chicago, Illinois. I have here with me Serge Abiteboul, who is a senior researcher at INRIA and the manager of the Gemo Database Group. Serge’s research interests are in databases, web data, and database theory. He received the SIGMOD Innovation Award in 1998, and he is a cofounder of Xyleme, a company that provides XML-based content management. His PhD is from the University of Southern California. So, Serge, welcome! Serge, you have built what may be the most successful database group in Europe. How did you do it? And are the challenges for building a group different in Europe than they would be in the US? Many people deserve credit for the group’s success. It is a continuation of a research group named Verso that was sponsored by Francois Bancilhon and Michel Scholl; so when I arrived, the group was already existing. My contribution was to bring in some new fresh very good scientists --- Luc Segoufin, Ioana Manolescu, Sophie Cluet. More recently, we moved to a new research unit of INRIA. The idea was to get closer to the university, so now we are at the University of Orsay; we merged with the knowledge representation group that was managed by Christina Rousset.
    [Show full text]
  • Example-Guided Synthesis of Relational Queries
    Example-Guided Synthesis of Relational Queries Aalok Thakkar Aaditya Naik Nathaniel Sands University of Pennsylvania University of Pennsylvania University of Southern California Philadelphia, USA Philadelphia, USA Los Angeles, USA [email protected] [email protected] [email protected] Rajeev Alur Mayur Naik Mukund Raghothaman University of Pennsylvania University of Pennsylvania University of Southern California Philadelphia, USA Philadelphia, USA Los Angeles, USA [email protected] [email protected] [email protected] Abstract 1 Introduction Program synthesis tasks are commonly specified via input- Program synthesis aims to automatically synthesize a pro- output examples. Existing enumerative techniques for such gram that meets user intent. While the user intent is classi- tasks are primarily guided by program syntax and only make cally described as a correctness specification, synthesizing indirect use of the examples. We identify a class of synthesis programs from input-output examples has gained much trac- algorithms for programming-by-examples, which we call tion, as evidenced by the many applications of programming- Example-Guided Synthesis (EGS), that exploits latent struc- by-example and programming-by-demonstration, such as ture in the provided examples while generating candidate spreadsheet programming [25], relational query synthesis [51, programs. We present an instance of EGS for the synthesis 57], and data wrangling [19, 33]. Nevertheless, their scalabil- of relational queries and evaluate it on 86 tasks from three ity remains an important challenge, and often hinders their application domains: knowledge discovery, program analy- application in the field [5]. sis, and database querying. Our evaluation shows that EGS Existing synthesis tools predominantly adapt a syntax- outperforms state-of-the-art synthesizers based on enumer- guided approach to search through the space of candidate ative search, constraint solving, and hybrid techniques in programs.
    [Show full text]
  • Paris C. Kanellakis
    In Memoriam Paris C Kanellakis Our colleague and dear friend Paris C Kanellakis died unexp ectedly and tragically on De cemb er together with his wife MariaTeresa Otoya and their b eloved young children Alexandra and Stephanos En route to Cali Colombia for an annual holiday reunion with his wifes family their airplane strayed o course without warning during the night minutes b efore an exp ected landing and crashed in the Andes As researchers we mourn the passing of a creative and thoughtful colleague who was resp ected for his manycontributions b oth technical and professional to the computer science research community As individuals wegrieveover our tragic lossof a friend who was regarded with great aection and of a happy thriving family whose warmth and hospitalitywere gifts appreciated by friends around the world Their deaths create for us a void that cannot b e lled Paris left unnished several pro jects including a pap er on database theory intended for this sp ecial issue of Computing Surveys to b e written during his holiday visit to Colombia Instead we wish to oer here a brief biographyofParis and a description of the research topics that interested Paris over the last few years together with the contributions that he made to these areas It is not our intention to outline denitive surveys or histories of these areas but rather to honor the signicantcontemp orary research of our friend Paris was b orn in Greece in to Eleftherios and Argyroula Kanellakis In he received the Diploma in Electrical Engineering from the National
    [Show full text]
  • Efficient Maintenance Techniques for Views Over Active Documents
    Efficient Maintenance Techniques for Views over Active Documents∗ Serge Abiteboul#, Pierre Bourhis#∗, Bogdan Marinoiu# #INRIA Saclay { Ile-de-France^ and University Paris Sud ∗ENS Cachan [email protected] ABSTRACT The core of the model is a complex stream processor that Many Web applications are based on dynamic interactions we call axlog widget. The term axlog results from the mar- between Web components exchanging flows of information. riage between Active XML (AXML for short) [5] and dat- Such a situation arises for instance in mashup systems or alog [7]. An axlog widget consists of an active document when monitoring distributed autonomous systems. Our work interacting with the rest of the system via streams of up- is in this challenging context that has generated recently a dates. See Figure 1. The input streams specify updates to lot of attention; see Web 2.0. We introduce the axlog for- the document (in the spirit of RSS feeds). In most of the mal model for capturing such interactions and show how paper, the focus is on input streams where the updates are this model can be supported efficiently. The central compo- only insertions, although we do consider briefly streams with nent is the axlog widget defined by one tree-pattern query deletions. An output stream is defined by a query on the or more, over an active document (in the Active XML style) document. More precisely, it represents the list of update that includes some input streams of updates. A widget gen- requests to maintain the view for the query. The queries we erates a stream of updates for each query, the updates that consider here are tree-pattern queries with value joins (and are needed to maintain the view corresponding to the query.
    [Show full text]
  • A Formal Study of Collaborative Access Control in Distributed Datalog
    A Formal Study of Collaborative Access Control in Distributed Datalog Serge Abiteboul1, Pierre Bourhis2, and Victor Vianu3 1 INRIA Saclay, Palaiseau, France; and ENS Cachan, Cachan, France [email protected] 2 CNRS, France; and Centre de Recherche en Informatique, Signal et Automatique (CRIStAL) – UMR 9189, Lille, France [email protected] 3 University of California San Diego, La Jolla, USA; and INRIA Saclay, Palaiseau, France [email protected] Abstract We formalize and study a declaratively specified collaborative access control mechanism for data dissemination in a distributed environment. Data dissemination is specified using distributed datalog. Access control is also defined by datalog-style rules, at the relation level for extensional relations, and at the tuple level for intensional ones, based on the derivation of tuples. The model also includes a mechanism for “declassifying” data, that allows circumventing overly restrictive access control. We consider the complexity of determining whether a peer is allowed to access a given fact, and address the problem of achieving the goal of disseminating certain information under some access control policy. We also investigate the problem of information leakage, which occurs when a peer is able to infer facts to which the peer is not allowed access by the policy. Finally, we consider access control extended to facts equipped with provenance information, motivated by the many applications where such information is required. We provide semantics for access control with provenance, and establish the complexity of determining whether a peer may access a given fact together with its provenance. This work is motivated by the access control of the Webdamlog system, whose core features it formalizes.
    [Show full text]