scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
zbMATH Open0848.68031MaRDI QIDQ4864249FDOQ4864249
Authors: Serge Abiteboul, Richard Hull, Victor Vianu 
Publication date: 30 January 1996
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15)
Cited In (only showing first 100 items - show all)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Inf-datalog, Modal Logic and Complexities
- A Generalization of the Inference Rules for Join Dependencies in Databases
- Model checking hybrid logics (with an application to semistructured data)
- Relational completeness of query languages for annotated databases
- Expressive power and succinctness of the positive calculus of binary relations
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- An inductive database system based on virtual mining views
- Normal forms for connectedness in categories
- The Kolmogorov expressive power of Boolean query languages
- View-based query answering in description logics: semantics and complexity
- Uniform Constraint Satisfaction Problems and Database Theory
- On the complexity of deciding typability in the relational algebra
- On reasoning about structural equality in XML: a description logic approach
- Expressiveness of concept expressions in first-order description logics
- Functional queries in datalog
- Aggregate operators in constraint query languages
- Repairing XML functional dependency violations
- Appropriate inferences of data dependencies in relational databases
- Information-based distance measures and the canonical reflection of view updates
- Information-Optimal Reflections of View Updates on Relational Database Schemata
- Reachability and connectivity queries in constraint databases
- Introduction to constraint databases
- Inexact and exact quantum searches with a preparation state in a three-dimensional subspace
- Tight lower bounds for query processing on streaming and external memory data
- Reasoning about XML update constraints
- Numerical constraints on XML data
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
- Algebraic rewritings for optimizing regular path queries.
- Comparison of expressive power of some query languages for databases
- Multi-modal nonmonotonic logics of minimal knowledge
- Probabilistic query answering over inconsistent databases
- On the complexity of hard enumeration problems
- Distance-based paraconsistent logics
- Propagating XML constraints to relations
- Monitoring metric first-order temporal properties
- Correspondence and translation for heterogeneous data
- Controlled query evaluation with open queries for a decidable relational submodel
- Maintaining distributed logic programs incrementally
- From orthogonal projections to a generalized quantum search
- Database query languages and functional logic programming
- Itemset frequency satisfiability: complexity and axiomatization
- On the complexity of existential positive queries
- In defense of PDDL axioms
- Functional and approximate dependency mining: database and FCA points of view
- On the complexity of database queries
- Restricted default theories: expressive power and outlier detection tasks
- Query languages for data exchange: beyond unions of conjunctive queries
- Database querying under changing preferences
- Expressive probabilistic description logics
- Characterising nested database dependencies by fragments of propositional logic
- Functional and multivalued dependencies in nested databases generated by record and list constructor
- On the content of materialized aggregate views
- Scaling-up reasoning and advanced analytics on BigData
- The complexity of higher-order queries
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
- Combining Consistency and Confidentiality Requirements in First-Order Databases
- Querying data sources that export infinite sets of views
- The complexity of embedded axiomatization for a class of closed database views
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
- RQL: a query language for rule discovery in databases
- Title not available (Why is that?)
- Well-definedness and semantic type-checking for the nested relational calculus
- Making big data small
- First-order under-approximations of consistent query answers
- Logic-Based Roughification
- Integrity constraints for XML
- Reconcilable differences
- Computing with infinitary logic
- Relative expressive power of navigational querying on graphs
- A framework for comparing query languages in their ability to express Boolean queries
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Conjunctive query containment with respect to views and constraints
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- A theoretical framework for knowledge-based entity resolution
- Matching dependencies: semantics and query answering
- Reactive computing as model generation
- Rewriting queries using views with access patterns under integrity constraints
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems
- Linking Data to Ontologies
- A Logical Approach to Constraint Satisfaction
- Decidable containment of recursive queries
- Conceptual Modeling for Data Integration
- Incorporating cardinality constraints and synonym rules into conditional functional dependencies
- Deciding confluence for a simple class of relational transducer networks
- Highly expressive query languages for unordered data trees
- On the data complexity of consistent query answering
- Structural tractability of counting of solutions to conjunctive queries
- Magic Sets and their application to data integration
- Characterisations of multivalued dependency implication over undetermined universes
- Order-sorted logic programming with predicate hierarchy
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Bounded situation calculus action theories
- Querying incomplete information in RDF with SPARQL
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Safety, domain independence and translation of complex value database queries
- Hypertree decompositions and tractable queries
- Foundations of semantic web databases
- Maintaining transitive closure in first order after node-set and edge-set deletions
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864249)
