|Table of Contents|

Efficient storage and query method for multidimensional uncertain sensor data

《南京理工大学学报》（自然科学版）[ISSN:1005-9830/CN:32-1397/N]

Issue:
2014年06期
Page:
750-
Research Field:
Publishing date:

Info

Title:
Efficient storage and query method for multidimensional uncertain sensor data
Author(s):
Zhang Jun1; Wang Yongli2
1.Jiangsu Police Institute,Nanjing 210031,China; 2.School of Computer Science and Engineering,NUST,Nanjing 210094,China
Keywords:
multidimensional sensors;  data;  storage;  query;  multidimensional array-tree;  Bayesian network;  graph data structure;  probabilistic graphical model;  real data sets;  synthetic data sets
PACS:
TP311.13
DOI:
-
Abstract:
To solve the problem that traditional database management technology can't manage uncertain data efficiently,a multidimensional array B-tree(MB-tree)is designed here.The MB-tree is a graph data structure based on Bayesian network.Bayesian network is used as a probabilistic graphical model to solve the storage and query problem of uncertain data.Mass multidimensional sensor data is modeled and responds to query.The predictability and relevance of multidimensional data structure are proved.The performance of the MB-tree is tested using real data sets and synthetic data sets.The coding accuracy of the MB-tree with potential co-distribution is verified.The query efficiency of the MB-tree is about 4 times as fast as those of alike graphical models.

References:

[1] Chang C,Acharya A,Sussman A,et al.T2:A customizable parallel database for multi-dimensional data[A].SIGMOD[C].[s.l.],USA:ACM Press,1998:221-232.
[2]Marathe A P,Salem K.Query processing techniques for arrays[J].The VLDB Journal,2002,11(1):68-91.
[3]SciDB Community Forum.SciDB:The computational DBMS for data-obsessed organizations; programmable from R & Python[EB/OL].http://scidb.org/,2014-11-01.
[4]Antova L,Jansen T,Koch C,et al.Fast and simple relational processing of uncertain data[A].2008 IEEE 24th International Conference on Data Engineering(ICDE'08)[C].Cancun,Mexico:ICDE,2008.
[5]Benjelloun O,Das Sarma A,Halevy A,et al.ULDBs:Databases with uncertainty and lineage[A].VLDB'06 Proceedings of the 32nd International Conference on Very Large Data Bases[C].Seoul,Korea:2006 VLDB Endowment,2006:953-964.
[6]Sen P,Deshpande A.Representing and querying correlated tuples in probabilistic databases[A].2007 IEEE 23rd International Conference on Data Engineering(ICDE,2007)[C].Istanbul,Turkey:IEEE,2007:596-605.
[7]蒋涛,高云君,张彬,等.不确定数据查询处理[J].电子学报,2013,41(5):966-976. Jiang Tao,Gao Yunjun,Zhang Bin,et al.Query processing on uncertain data[J].Acta Electronica Sinica,2013,41(5):966-976.
[8]张慧,郑吉平,韩秋廷.BTreeU-Topk:基于二叉树的不确定数据上的Top-k查询算法[J].计算机研究与发展,2012,49(10):2095-2105. Zhang Hui,Zheng Jiping,Han Qiuting.BTreeU-Topk:Binary-tree based Top-k query algorithms on uncertain data[J].Journal of Computer Research and Development,2012,49(10):2095-2105.
[9]周逊,李建中,石胜飞.不确定数据上两种查询的分布式聚集算法[J].计算机研究与发展,2010,47(5):762-771. Zhou Xun,Li Jianzhong,Shi Shengfei.Distributed aggregations for two queries over uncertain data[J].Journal of Computer Research and Development,2010,47(5):762-771.
[10]Jordan M.Learning in graphical models[M].Cambridge,MA,USA:MIT Press,1998.
[11]Ge T,Zdonik S.Handling uncertain data in array database systems[A].IEEE 24th International Conference on Data Engineering(ICDE 2008)[C].Cancun,Mexico:IEEE,2008:1140-1149.
[12]Ge Tingjian,Zdonik S.Handling uncertain data in array database systems[A].IEEE 24th International Conference on Data Engineering(ICDE 2008)[C].Cancun,Mexico:ICDE,2008:1140-1149.
[13]Jampani R,Xu Fei,Wu Mingxi,et al.MCDB:A Monte Carlo approach to managing uncertain data[A].Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data(SIGMOD'08)[C].New York,NY,USA:ACM press,2008.
[14]Bishop C M.Pattern recognition and machine learning[M].New York,NY,USA:Springer,2006.

Memo

Memo:
-
Last Update: 2014-12-31