Merging DBMs Efficiently – Extended
نویسنده
چکیده
In this paper we present different algorithms to reduce the number of DBMs in federations by merging them. Federations are unions of DBMs and are used to represent non-convex zones. Inclusion checking between DBMs is a limited technique to reduce the size of federations and how to choose some DBMs to merge them into a larger one is a combinatorial problem. We present a number of simple but efficient techniques to avoid searching the combinations while still being able to merge any number of DBMs.
منابع مشابه
An Extensible Storage Manager for Mobile DBMS
The increasing usage of mobile devices like PDAs, laptops, or embedded devices results in a new type of application which must especially consider the strict limitations of the used mobile hardware. One aspect of the application development is the storage and retrieval of data. For non-mobile application this is often efficiently realized with database management systems, which offer standardiz...
متن کاملLearnability of Probabilistic Automata via Oracles
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed μ-distinguishable. In this paper, we prove that state merging algorithms can be extended to efficiently learn a larger class of automata. In particular, we show learnability of a subclass which we call μ2-distinguishable. Using an analog of the Myhill-Nerode theorem for probabilisti...
متن کاملTowards automatic merging of domain ontologies: The HCONE-merge approach
Latest research efforts on the semi-automatic coordination of ontologies “touch” on the mapping /merging of ontologies using the whole breadth of available knowledge. Addressing this issue, this paper presents the HCONE-merge approach, which is further extended towards automating the merging process. HCONE-merge makes use of the intended informal meaning of concepts by mapping them to WordNet s...
متن کاملData Modifications and Versioning in Trio
This paper presents the first DBMS for uncertain data that incorporates data modifications and a simple versioning system. Our work is in the context of Trio, a project at Stanford for managing data uncertainty and lineage. We establish SQL-based language constructs for data modifications, and an extended data model ULDB that supports these modifications yielding versioned relations. We show th...
متن کاملScaling Up Reasoning about Actions Using Relational Database Technology
Reiter’s variant of the Situation Calculus is tightly related to relational databases, when complete information on the initial situation is available. In particular, the information on the initial situation can be seen as a relational database, and actions, as specified by the preconditions and successor state axioms, can be seen as operations that change the state of the database. In this pap...
متن کامل