Scaling access to heterogeneous data sources with disco

被引:79
作者
Tomasic, A [1 ]
Raschid, L
Valduriez, P
机构
[1] Inst Natl Rech Informat & Automat, F-78153 Le Chesnay, France
[2] Univ Maryland, Maryland Business Sch, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
heterogeneous database; query reformulation; source capability; heterogeneous cost model; partial answer; partial evaluation;
D O I
10.1109/69.729736
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Accessing many data sources aggravates problems for users of heterogeneous distributed databases. Database administrators must deal with fragile mediators, that is, mediators with schemas and views that must be significantly changed to incorporate a new data source. When implementing translators of queries from mediators to data sources, database implementers must deal with data sources that do not support all the functionality required by mediators. Application programmers must deal with graceless failures for unavailable data sources. Queries simply return failure and no further information when data sources are unavailable for query processing. The Distributed information Search COmponent (Disco) addresses these problems. Data modeling techniques manage the connections to data sources, and sources can be added transparently to the users and applications. The interface between mediators and data sources flexibly handles different query languages and different data source functionality. Query rewriting and optimization techniques rewrite queries so they are efficiently evaluated by sources. Query processing and evaluation semantics are developed to process queries over unavailable data sources. In this article. we describe 1) the distributed mediator architecture of Disco; 2) the data model and its modeling of data source connections; 3) the interface to underlying data sources and the query rewriting process; and 4) query processing semantics. We describe several advantages of our system.
引用
收藏
页码:808 / 823
页数:16
相关论文
共 53 条
[1]  
ADALI S, 1996, P ACM SIGMOD INT C M, P137
[2]  
AHMED R, 1991, IEEE COMPUT, V24, P12
[3]  
[Anonymous], MODERN DATABASE SYST
[4]  
Arens Y., 1993, International Journal of Intelligent & Cooperative Information Systems, V2, P127, DOI 10.1142/S0218215793000071
[5]  
BARSALOU T, 1992, P INT C DAT ENG
[6]  
BATINI C, 1986, COMPUT SURV, V18, P323, DOI 10.1145/27633.27634
[7]  
BLAKELEY J, 1996, ACM SIGMOD RECORD, V25, P161
[8]  
BONNET P, 1997, RR3127 INRIA
[9]  
CAREY M, 1995, HETEROGENEOUS MULTIM
[10]  
CATTELL R, 1997, OBJECT DATABASE STAN