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
- 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
- Proving semantical equivalence of data specifications
- Relative expressive power of navigational querying on graphs
- A framework for comparing query languages in their ability to express Boolean queries
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- MODELLING UNCERTAINTY IN MULTIMEDIA DATABASE SYSTEMS: AN EXTENDED POSSIBILISTIC APPROACH
- Monitoring of temporal first-order properties with aggregations
- Parameterized complexity of completeness reasoning for conjunctive queries
- Tractability and intractability of controlled languages for data access
- The navigational power of web browsers
- Inherent complexity of recursive queries
- Representing ontologies using description logics, description graphs, and rules
- On database query languages for K-relations
- Temporal connectives versus explicit timestamps to query temporal databases
- Binary equality implication constraints, normal forms and data redundancy
- Towards an algebraic theory of information integration
- LARS: a logic-based framework for analytic reasoning over streams
- A semantic approach to optimize linear datalog programs
- Abstract state machines and computationally complete query languages
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation
- Finitely representable databases
- A probabilistic view of Datalog parallelization
- Queries with arithmetical constraints
- Automated reformulation of specifications by safe delay of constraints
- Inseparability and conservative extensions of description logic ontologies: a survey
- Path constraints in semistructured databases
- Instance-level update in DL-Lite ontologies through first-order rewriting
- Deciding implication for functional dependencies in complex-value databases
- Inclusion dependencies and their interaction with functional dependencies in SQL
- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications
- Refinements of complexity results on type consistency for object-oriented databases
- Weighted hypertree decompositions and optimal query plans
- An equational logic based approach to the security problem against inference attacks on object-oriented databases
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)
