scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
zbMath0848.68031MaRDI QIDQ4864249
Serge Abiteboul, Victor Vianu, Richard Hull
Publication date: 30 January 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15)
Related Items (only showing first 100 items - show all)
Reactive computing as model generation ⋮ On the data complexity of consistent query answering ⋮ Highly expressive query languages for unordered data trees ⋮ Deciding confluence for a simple class of relational transducer networks ⋮ Structural tractability of counting of solutions to conjunctive queries ⋮ Querying incomplete information in RDF with SPARQL ⋮ Bounded situation calculus action theories ⋮ Maintaining transitive closure in first order after node-set and edge-set deletions ⋮ Implication and axiomatization of functional and constant constraints ⋮ Relational lattices: from databases to universal algebra ⋮ Representing ontologies using description logics, description graphs, and rules ⋮ Embedding relational databases in object ontologies: implementation issues ⋮ Knowledge base exchange: the case of OWL 2 QL ⋮ Binary equality implication constraints, normal forms and data redundancy ⋮ Converging to the chase -- a tool for finite controllability ⋮ Constraint satisfaction with bounded treewidth revisited ⋮ A semantic approach to optimize linear datalog programs ⋮ Deciding implication for functional dependencies in complex-value databases ⋮ Logic programming approach to automata-based decision procedures ⋮ Database query languages and functional logic programming ⋮ Towards more expressive ontology languages: the query answering problem ⋮ Well-definedness and semantic type-checking for the nested relational calculus ⋮ Rewriting queries using views with access patterns under integrity constraints ⋮ An Ehrenfeucht-Fraïssé game approach to collapse results in database theory ⋮ Propagating XML constraints to relations ⋮ Specification and verification of data-driven Web applications ⋮ Weighted hypertree decompositions and optimal query plans ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ An equational logic based approach to the security problem against inference attacks on object-oriented databases ⋮ Question answering and database querying: bridging the gap with generalized quantification ⋮ On the complexity of division and set joins in the relational algebra ⋮ Magic Sets and their application to data integration ⋮ Dependency-preserving normalization of relational and XML data ⋮ Extending inclusion dependencies with conditions ⋮ On simplification of schema mappings ⋮ A dichotomy in the complexity of counting database repairs ⋮ Model-checking games for logics of imperfect information ⋮ Monitoring of temporal first-order properties with aggregations ⋮ A theoretical framework for knowledge-based entity resolution ⋮ A relation-algebraic approach to the ``Hoare logic of functional dependencies ⋮ An inductive database system based on virtual mining views ⋮ On the complexity of sampling query feedback restricted database repair of functional dependency violations ⋮ View-based query answering in description logics: semantics and complexity ⋮ Repairing XML functional dependency violations ⋮ Appropriate inferences of data dependencies in relational databases ⋮ Information-based distance measures and the canonical reflection of view updates ⋮ Characterisations of multivalued dependency implication over undetermined universes ⋮ Query languages for data exchange: beyond unions of conjunctive queries ⋮ Querying data sources that export infinite sets of views ⋮ Reconcilable differences ⋮ On rules with existential variables: walking the decidability line ⋮ Prioritized repairing and consistent query answering in relational databases ⋮ Probabilistic query answering over inconsistent databases ⋮ Maintaining distributed logic programs incrementally ⋮ Reasoning about XML update constraints ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Restricted default theories: expressive power and outlier detection tasks ⋮ Inexact and exact quantum searches with a preparation state in a three-dimensional subspace ⋮ Computing with infinitary logic ⋮ The complexity of higher-order queries ⋮ Conjunctive query containment with respect to views and constraints ⋮ World-set decompositions: Expressiveness and efficient algorithms ⋮ RQL: a query language for rule discovery in databases ⋮ Proving semantical equivalence of data specifications ⋮ Structure identification of Boolean relations and plain bases for co-clones ⋮ ERBlox: combining matching dependencies with machine learning for entity resolution ⋮ First-order under-approximations of consistent query answers ⋮ Relative expressive power of navigational querying on graphs ⋮ Tractability and intractability of controlled languages for data access ⋮ The navigational power of web browsers ⋮ Queries and materialized views on probabilistic databases ⋮ Relational completeness of query languages for annotated databases ⋮ Foundations of semantic web databases ⋮ On the finite controllability of conjunctive query answering in databases under open-world assumption ⋮ Numerical constraints on XML data ⋮ Inherent complexity of recursive queries ⋮ Hypertree decompositions and tractable queries ⋮ Aggregate operators in constraint query languages ⋮ Towards an algebraic theory of information integration ⋮ On database query languages for K-relations ⋮ Tractable query answering and rewriting under description logic constraints ⋮ Decidable containment of recursive queries ⋮ XML queries and constraints, containment and reformulation ⋮ On reasoning about structural equality in XML: a description logic approach ⋮ On the complexity of entailment in existential conjunctive first-order logic with atomic negation ⋮ Incorporating cardinality constraints and synonym rules into conditional functional dependencies ⋮ Inclusion dependencies and their interaction with functional dependencies in SQL ⋮ Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications ⋮ I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ Axiomatizing functional dependencies in the higher-order entity-relationship model ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Modeling virtual worlds in databases ⋮ Reasoning about nondeterministic and concurrent actions: A process algebra approach ⋮ Safety, domain independence and translation of complex value database queries ⋮ A more general theory of static approximations for conjunctive queries ⋮ Distribution policies for Datalog ⋮ Graph-theoretic formalization of hybridization in DNA sticker complexes ⋮ Order-sorted logic programming with predicate hierarchy ⋮ An incremental algorithm for DLO quantifier elimination via constraint propagation
Uses Software
This page was built for publication:
