• Publications
  • Influence
On the Difference between Updating a Knowledge Base and Revising It
  • 1,015
  • 105
  • PDF
Propositional Knowledge Base Revision and Minimal Change
Abstract The semantics of revising knowledge bases represented by sets of propositional sentences is analyzed from a model-theoretic point of view. A characterization of all revision schemes thatExpand
  • 782
  • 95
Answering Queries Using Views.
  • 436
  • 40
Finding Regular Simple Paths in Graph Databases
We consider the following problem: given a labelled directed graph G and a regular expression R, find all pairs of nodes connected by a simple path such that the concatenation of the labels along theExpand
  • 392
  • 33
  • PDF
Extending query rewriting techniques for fine-grained access control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views, to control whichExpand
  • 370
  • 33
  • PDF
GraphLog: a visual formalism for real life recursion
We present a query language called GraphLog, based on a graph representation of both data and queries. Queries are graph patterns. Edges in queries represent edges or paths in the database. RegularExpand
  • 402
  • 30
Database techniques for the World-Wide Web: a survey
The popularity of the World-Wide Web (WWW) has made it a prime vehicle for disseminating information. The relevance of database concepts to the problems of managing and querying this information hasExpand
  • 680
  • 27
  • PDF
Similarity-based queries for time series data
We study a set of linear transformations on the Fourier series representation of a sequence that can be used as the basis for similarity queries on time-series data. We show that our set ofExpand
  • 384
  • 24
  • PDF
Similarity-based queries for time series data
We study a set of linear transformations on the Fourier series representation of a sequence that can be used as the basis for similarity queries on time-series data. We show that our set ofExpand
  • 384
  • 24
  • PDF
Testing implications of data dependencies
Presented is a computation method—the chase—for testing implication of data dependencies by a set of data dependencies. The chase operates on tableaux similar to those of Aho, Sagiv, and Ullman. TheExpand
  • 378
  • 20
  • PDF