|Table of Contents|

[1] Miao Zhuang, Zhang Yafei, Wang JinpengLu JianjiangZhou Bo,. Semantic-based query processing for relational data integration [J]. Journal of Southeast University (English Edition), 2011, 27 (1): 22-25. [doi:10.3969/j.issn.1003-7985.2011.01.005]
Copy

Semantic-based query processing for relational data integration()
关系数据集成中的语义查询处理技术
Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
27
Issue:
2011 1
Page:
22-25
Research Field:
Automation
Publishing date:
2011-03-30

Info

Title:
Semantic-based query processing for relational data integration
关系数据集成中的语义查询处理技术
Author(s):
Miao Zhuang, Zhang Yafei, Wang JinpengLu JianjiangZhou Bo
Institute of Command Automation, PLA University of Science and Technology, Nanjing 210007, China
苗壮, 张亚非, 王进鹏, 陆建江, 周波
解放军理工大学指挥自动化学院, 南京 210007
Keywords:
data integration;  relational database;  simple protocol and RDF query language(SPARQL);  minimal connectable unit;  query processing
数据集成;  关系数据库;  SPARQL;  最小可连接单元;  查询处理
PACS:
TP182
DOI:
10.3969/j.issn.1003-7985.2011.01.005
Abstract:
To solve the query processing correctness problem for semantic-based relational data integration, the semantics of SAPRQL(simple protocol and RDF query language)queries is defined. In the course of query rewriting, all relative tables are found and decomposed into minimal connectable units. Minimal connectable units are joined according to semantic queries to produce the semantically correct query plans. Algorithms for query rewriting and transforming are presented. Computational complexity of the algorithms is discussed. Under the worst case, the query decomposing algorithm can be finished in O(n2)time and the query rewriting algorithm requires O(nmm)time. And the performance of the algorithms is verified by experiments, and experimental results show that when the length of query is less than 8, the query processing algorithms can provide satisfactory performance.
为解决基于语义的关系数据集成中的查询处理正确性问题, 形式化定义了SPARQL查询语句的语义.在查询重写过程中, 发现查询相关的数据表并将其分解为最小可连接单元, 再根据查询语义连接最小可连接单元来产生正确的查询.给出了基于语义的查询重写和查询转换算法.对算法复杂性进行了讨论, 在最坏情况下, 查询分解算法可在O(n2)时间内完成, 查询重写的时间复杂度为O(nmm).通过实验验证了算法的性能, 实验结果表明当查询长度小于8, 而数据源较多时, 查询处理算法具有较好的效果.

References:

[1] Gantz J. The diverse and exploding digital universe[R]. Framingham, MA, USA: International Data Corporation, 2008.
[2] Bell G, Hey T, Szalay A. Beyond the data deluge[J]. Science, 2009, 323(5919): 1297-1298.
[3] Halevy Y A, Rajaraman A, Ordille J J. Data integration: the teenage years[C]//Proc of the 32nd International Conference on Very Large Data Bases. Seoul, Korea, 2006: 9-16.
[4] Bernstein A P, Hass M L. Information integration in the enterprise[J]. Communications of the ACM, 2008, 51(9): 72-79.
[5] Dou D, LePendu P. Ontology-based integration for relational databases[C]//Proc of ACM Symposium on Applied Computing. Dijon, France, 2006: 461-466.
[6] Zhu H, Madnick S. A lightweight ontology approach to scalable interoperability[C]//Very Large Data Bases Workshop on Ontology-Based Techniques or DataBases and Information Systems. Seoul, Korea, 2006: 45-54.
[7] Erling O, Mikhailov I. RDF support in the virtuoso DBMS[C]//Proc of the 1st Conference on Social Semantic Web. Leipzig, Germany, 2007: 59-68.
[8] Hommeaux E, Seaborne A. SPARQL query language for RDF[EB/OL].(2008-01)[2010-01-10]. http://www.w3.org/TR/rdf-sparql-query/.
[9] Prudhommeaux E. SPASQL: SPARQL support in MySQL[EB/OL].(2006)[2009-12-20]. http://xtech06.usefulinc.com/schedule/paper/156.
[10] Pérez J, Arenas M, Gutierrez C. Semantics and complexity of SPARQL[C]//Proc of the 5th International Semantic Web Conference. Athens, USA, 2006: 30-43.

Memo

Memo:
Biography: Miao Zhuang(1976—), male, doctor, associate professor, emiao_beyond@163.com.
Foundation items: Weaponry Equipment Pre-Research Foundation of PLA Equipment Ministry(No.9140A06050409JB8102), Pre-Research Foundation of PLA University of Science and Technology(No.2009JSJ11).
Citation: Miao Zhuang, Zhang Yafei, Wang Jinpeng, et al.Semantic-based query processing for relational data integration[J].Journal of Southeast University(English Edition), 2011, 27(1):22-25.[doi:10.3969/j.issn.1003-7985.2011.01.005]
Last Update: 2011-03-20