DocumentCode
3146638
Title
Conflict tolerant queries in AURORA
Author
Yan, Ling Ling ; Özsu, M. Tamer
Author_Institution
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
fYear
1999
fDate
1999
Firstpage
279
Lastpage
290
Abstract
Conflict tolerant queries are a new way of dealing with instance level conflicts in data integrated from multiple sources. In contrast to the traditional approach of resolving such conflicts during schema integration using aggregation functions, we establish a query model and processing techniques to tolerate these conflicts at query time to a degree specified by the users. Resolutions are only performed to produce conflict-free results. Currently we support three levels of conflict tolerance: HighConfidence, RandomEvidence, and PossibleAtAll and allow user-defined functions to be used for conflict resolution. The approach reduces the overhead of conflict detection and resolution and lends itself to new query optimization techniques. Fundamentally, our approach allows users to handle conflict at a coarse granularity to achieve better query performance when conflict resolution requirements are relaxed and when data contain occasional conflicts
Keywords
distributed databases; query processing; AURORA; HighConfidence; PossibleAtAll; RandomEvidence; aggregation functions; coarse granularity; conflict detection; conflict resolution; conflict tolerant queries; data integrated; instance level conflicts; query model; query optimization techniques; query processing techniques; schema integration; user-defined functions; Costs; Database systems; Electrical capacitance tomography; Information retrieval; Internet; Laboratories; Microwave integrated circuits; Query processing; Read only memory;
fLanguage
English
Publisher
ieee
Conference_Titel
Cooperative Information Systems, 1999. CoopIS '99. Proceedings. 1999 IFCIS International Conference on
Conference_Location
Edinburgh
Print_ISBN
0-7695-0384-5
Type
conf
DOI
10.1109/COOPIS.1999.792177
Filename
792177
Link To Document