• Corpus ID: 5348963

Principles of Database and Knowledge-Base Systems, Volume II

  title={Principles of Database and Knowledge-Base Systems, Volume II},
  author={Jeffrey D. Ullman},
  booktitle={Principles of computer science series},
  • J. Ullman
  • Published in
    Principles of computer…
  • Computer Science
A Rule-based Language for Application Integration
The Logic Integration Language (LiLa) is proposed, which redefine integration logic tailored for data-intensive processing and proposes a novel approach to data-centric integration modeling, from which the control-and data flow are derived and applied to a conventional integration system.
Generating Flexible Workloads for Graph Databases
Graph data management tools are nowadays evolving at a great pace. Key drivers of progress in the design and study of data intensive systems are solutions for synthetic generation of data and
Data-centric Programming for Distributed Systems
This thesis presents an attempt to avert this crisis by rethinking both the languages used to implement distributed systems and the analyses and tools used to understand them, and develops Bloom, which provides powerful analysis capabilities that identify when distributed programs produce deterministic outcomes despite widespread nondeterminism in their executions.
MELD: A Logical Approach to Distributed and Parallel Programming
This report describes Meld and how it can also be used to program more traditional parallel machines and evaluates Meld on a small set of benchmarks and describes some of the methods used to make it an effective tool for parallel programming.
Structural optimization of a full-text n-gram index using relational normalization
The two-level n-gram inverted index that significantly reduces the size and improves the query performance by using the relational normalization theory is proposed and it is formally proved that this two- level construction is identical to the relationalnormalization process.
Ontology-driven information extraction and integration from heterogeneous distributed autonomous data sources: A federated query centric approach.
This thesis presents a novel ontology-driven approach which builds on recent advances in artificial intelligence, databases, and distributed computing to support customizable information extraction and integration in such domains.
The complexity of acyclic conjunctive queries
We show that the problem of evaluating acylic Boolean database-queries is LOGCFL-complete and thus highly parallelizable. We present a parallel database algorithm solving this problem with a
Eeciently Executing Information Gathering Plans
An algorithm for reducing the number of information sources in an information gathering (IG) plan by reasoning with localized closed world (LCW) statements is presented and can handle recursive information gathering plans that arise commonly in practice.
Constraint checking with partial information
This paper explores techniques for assuring constraint satisfaction without performing a complete evaluation of the constraints, and considers methods that use only constraint definitions, methods thatuse constraints and updates, and methods thatUse constraints, updates,and “local” data.
FO Queries Strongly Distributing over Components in Arbitrary Cardinality
It is proved that the decision problem of establishing whether a FO query strongly distributes over components is undecidable and how some syntactic bonds typical of Datalog with negation, namely safeness, play a crucial role in specifying strongly distributive FO queries is highlighted.