DocumentCode
2540994
Title
Computing approximate joins of relations based on entity chains
Author
Liu, Bo
Author_Institution
Dept. of Comput. Sci., Jinan Univ., Guangzhou, China
fYear
2012
fDate
29-31 May 2012
Firstpage
1627
Lastpage
1631
Abstract
Because of data inconsistencies among multiple databases, it is not always possible to get exact query answers from them. The paper proposes the method based on entity chains for approximate join queries on multiple relations, and designs extended SQL query language to implement the main procedures. An entity chain consists of the entities belonging to different relations with the same or approximate linkage attribute values, and is computed by analyzing similarity of linkage attributes in different relations. Entity chains provide facilities for approximate joins, and can be used to improve efficiency of computing approximate joins on multiple relations in information systems.
Keywords
SQL; approximation theory; entity-relationship modelling; question answering (information retrieval); data inconsistency; entity chain; extended SQL query language; information system; linkage attribute value approximation; query answering; query approximation; Algorithm design and analysis; Approximation algorithms; Cleaning; Couplings; Database systems; approximate join; database; entity chain; multi-relations;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on
Conference_Location
Sichuan
Print_ISBN
978-1-4673-0025-4
Type
conf
DOI
10.1109/FSKD.2012.6233722
Filename
6233722
Link To Document