Specifying interdatabase dependencies in a multidatabase environment

Rusinkiewicz, Marek; Sheth, Amit P.; Karabatis, George

doi:10.1109/2.116888

Cited by 78 publications

(29 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dependences between data objects can generally be described by the tuple <S,D,P,C,A>, also known as D 3 (data dependency descriptor) [7]. S stands for the source objects and D for the destination objects.…”

Section: Specification Of Consistence Constraintsmentioning

confidence: 99%

Enhancing ECA Rules for Distributed Active Database Systems

Heimrich

Specht

2003

Web, Web-Services, and Database Systems

View full text Add to dashboard Cite

Abstract. ECA (event/condition/action) rules have been developed for central active database systems. In distributed active database systems the problem of inaccessibility of partial systems raises and thus the undecidability of ECA conditions referring to remote systems. This work proposes an enhancement of ECA rules for distributed active database systems to react also in the case of inaccessibility and undecidability. Therefore, the ECA evaluation will be enhanced to a strict function with the inaccessibility state Ω and a new alternative action AA enriches the classical ECA rules. The advantages and the usage of this approach are shown by an example of maintaining data consistency in distributed active database systems.

show abstract

Section: Specification Of Consistence Constraintsmentioning

confidence: 99%

Enhancing ECA Rules for Distributed Active Database Systems

Heimrich

Specht

2003

Web, Web-Services, and Database Systems

View full text Add to dashboard Cite

show abstract

“…The issue of maintaining consistency of replicated data across loosely-coupled, semantically heterogeneous databases has been considered in, e.g., [9,10,27]. Our constraint checking problem can be seen as a special case (or first step) of that consistency maintenance problem.…”

Section: Related Workmentioning

confidence: 99%

“…The approach is similar to the simplest case in our family of protocols. Similar issues are addressed in [27], but no specific protocols are provided. In [10], an implementation mechanism based on active rules is proposed for maintaining replication consistency.…”

Section: Related Workmentioning

confidence: 99%

Untitled

Grefen

Widom

1997

Distributed and Parallel Databases

View full text Add to dashboard Cite

Abstract.A federated database is comprised of multiple interconnected database systems that primarily operate independently but cooperate to a certain extent. Global integrity constraints can be very useful in federated databases, but the lack of global queries, global transaction mechanisms, and global concurrency control renders traditional constraint management techniques inapplicable. This paper presents a threefold contribution to integrity constraint checking in federated databases: (1) The problem of constraint checking in a federated database environment is clearly formulated. (2) A family of protocols for constraint checking is presented. (3) The differences across protocols in the family are analyzed with respect to system requirements, properties guaranteed by the protocols, and processing and communication costs. Thus, our work yields a suite of options from which a protocol can be chosen to suit the system capabilities and integrity requirements of a particular federated database environment.

show abstract

“…System reliability should also be significantly higher since there are fewer dependencies on network connectivity and the individual data sources (again, assuming that the system in which the materialized solution is stored is reliable). It is also less costly to implement any interdata source constraints that have been determined in the integration [2]. The disadvantages of a materialized solution include the initial cost of constructing the warehouse, and the cost of maintaining currency of the data.…”

Section: Introductionmentioning

confidence: 99%

Database Transformations for Biological Applications

Overton¹,

Davidson²,

Buneman³

et al. 2001

View full text Add to dashboard Cite

A bsfractThe goal of this project was to develop tools to facilitate data transformations between heterogeneous data sources found throughout biomedical applications. Such transformations are necessary when sharing data between different groups worlung on related problems as well as when querying data spread over different databases, files and software analysis packages.We summarize progress made during the term of this grant in the development of the Kleisli query system. Kleisli implements a high level query language called the Collection Programming anguage (CPL) and contains drivers to access many types of databases found throughout the genomic community, including: relational databases (Oracle and Sybase); ASN.l; BLAST and FASTA; Shore (and potentially other objectoriented databases); EcoCyc (a Lisp-based metabolic pathways system); SRS; Medline; MMDB; OPWCTL; US and IBM patent databases. The query system is based on a complex model of data, which provides a natural encoding of data in this domain, and uses a number of optimization strategies and sophisticated parallel execution strategies to improve the performace of queries. The system has been used for applications with the Center fdr Bioinformatics at the University of Pennsylvania, and within projects at SmithKline Beecham. It also forms the basis of the Tambis system developed at the University of Mancheste, UK.We then describe a re-implementation of Kleisli called K2. K2 is implemented in Java (Kleisli was implemented in the rapid prototyping language ML), and allows the overlay on an ontology to aid integration. The report closes with some preliminary observations on the use of XML for data integration.

show abstract

Specifying interdatabase dependencies in a multidatabase environment

Cited by 78 publications

References 5 publications

Enhancing ECA Rules for Distributed Active Database Systems

Enhancing ECA Rules for Distributed Active Database Systems

Untitled

Database Transformations for Biological Applications

Contact Info

Product

Resources

About