计算机科学 ›› 2021, Vol. 48 ›› Issue (6): 57-62.doi: 10.11896/jsjkx.200700016

• 数据库&大数据&数据科学 • 上一篇    下一篇

基于查询对象的路网Skyline查询中Why-not问题的研究

朱润泽, 秦小麟, 刘嘉琛   

  1. 南京航空航天大学计算机科学与技术学院 南京211106
  • 收稿日期:2020-07-02 修回日期:2020-11-10 出版日期:2021-06-15 发布日期:2021-06-03
  • 通讯作者: 秦小麟(qinxcs@nuaa.edu.cn)
  • 基金资助:
    国家自然科学基金(61728204)

Study on Why-not Problem in Skyline Query of Road Network Based on Query Object

ZHU Run-ze, QIN Xiao-lin, LIU Jia-chen   

  1. College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China
  • Received:2020-07-02 Revised:2020-11-10 Online:2021-06-15 Published:2021-06-03
  • About author:ZHU Run-ze,born in 1996,postgra-duate.His main research interests include skyline query and so on.(1165248566@qq.com)
    QIN Xiao-lin,born in 1953,Ph.D,professor,is a senior member of China Computer Federation.His main research interests include spatial and spatio-temporal database,data management and security in distributed environment,etc.
  • Supported by:
    National Natural Science Foundation of China(61728204).

摘要: 随着信息技术的高度发展,数据成为了重要的战略资源,如何利用大数据进行查询是众多学者的研究内容。与此同时,被查询对象在未被选择时,如何利用大数据使自己能够满足用户的查询要求也成为了重要的研究方向。在分析现有算法存在的不足的基础上,根据实际生活中查询的特点,对基于查询对象的路网Skyline查询中的why-not问题进行了研究,并针对此问题提出了属性优化算法。该算法包括修改why-not点的空间属性和非空间属性,以及修改查询中心的位置。考虑到实际情况,将时间属性单列而不是简单地将其作为非空间属性的一维。算法采用剪枝策略以提高效率。最后在真实路网数据和生成的兴趣点数据集上进行对比实验,结果表明在特定时间段同时修改空间、非时空属性的方法可以有效地解决此问题。

关键词: Skyline查询, why-not问题, 剪枝, 路网, 时空属性

Abstract: With the rapid development of information technology,data becomes an important strategic resource.How to use big data to query is the research content of many scholars.At the same time,when the queried objects are not selected,how to use big data to meet the query requirements of users has also become an important research direction.Based on the analysis of the shortcomings of the existing algorithms,according to the characteristics of the real life queries,this paper studies the why-not problem in the Skyline query of the road network based on the query object,and puts forward the attribute optimization algorithm for this problem.The algorithm includes modifying the spatial and non spatial attributes of why-not point,as well as modifying the location of query center.Considering the actual situation,the time attribute is considered separately rather than simply as one dimension of non spatial attribute.The algorithm adopts pruning strategy to improve the efficiency.Finally,the real road network data and the generated interest point data set are used for comparative experiments.The results show that the method of modifying the spatial and non spatial attributes at the same time in a specific period of time can effectively solve this problem.

Key words: Prune, Road network, Skyline query, Spatiotemporal attribute, Why-not problem

中图分类号: 

  • TP311
[1]LIN X,XU J,HU H.Range-based skyline queries in mobile environment[J].IEEE Transactions on Knowledge and Data Engineering,2013,25(4):835-849.
[2]BORZSONY S,KOSSMANN D,STOCKER K.The skylineoperator[C]//IEEE International Conference on Data Enginee-ring.2001:421-430.
[3]HUANG X,JENSEN C S.In-route skyline querying for location-based services[C]//Web and Wireless Geographical Information Systems.2004:120-135.
[4]DENG K,ZHOU X,TAO H.Multi-source skyline query pro-cessingin road networks[C]//IEEE International Conference on Data Engineering.2007:796-805.
[5]HUANG Y K,CHANG C H,LEE C.Continuous distance-based skyline queries in road networks[J].Information Systems,2012,37(7):611-633.
[6]SHI C,QIN X,WANG L.Continuous skyline queries for movingobjects in road networks[J].Journal of Software-Evolution and Process,2015,10(2):190-200.
[7]JIANG S,ZHENG J,CHEN J,et al.Efficient computation ofcontinuous range skyline queries in road networks[C]//International Conference on Intelligent Computing.Springer International Publi-shing,2016:520-532.
[8]SHANG S,CHEN L,WEI Z,et al.Collective travel planning in spatial networks[J].IEEE Transactions on Know-ledge and Data Engineering,2016,28(5):1132-1146.
[9]SHANG S,ZHENG K,JENSEN C S,et al.Discovery of Path Nearby Clusters in Spatial Networks[J].IEEE Transactions on Know-ledge & Data Engineering,2015,27(6):1505-1518.
[10]SHANG S,DING R,ZHENG K,et al.Personalized trajectory matching in spatial networks[J].Very LargeData Bases Journal,2014,23(3):449-468.
[11]XIE K,DENG K E,SHANG S,et al.Finding Alternative Shortest Paths in Spatial Networks[J].ACM Transactions on Database Systems,2012,37(4):1-31.
[12]WANG M,FU W,HAO S,et al.Scalable semi-supervised lear-ning by efficient anchor graph regularization [J].IEEE Transactions on Knowledge & Data Engineering,2016,28(7):1864-1877.
[13]WANG M,FU W,HAO S,et al.Learning on big graph:Label infe-rence and regularization with anchor hierarchy[J].IEEE Transactions on Knowledge & Data Engineering,2017,29(5):1101-1114.
[14]SHANG S,CHEN L,WEI Z,et al.Trajectory similarity join in spatial networks[J].Proceedings of the Vldb Endowment,2017,10(11):1178-1189.
[15]FU X,MIAO X,XU J,et al.Continuous range-based sky-line queries in road networks[J].World Wide Web Journal,2017,20:1443-1467.
[16]CHAPMAN A,JAGADISH H V.Why not?[C]//Proc.ACM SIGMODInt.Conf.Manag.Data.2009:523-534.
[17]BIDOIT N,HERSCHEL M,TZOMPANAKI K.Query-basedwhy-not provenance with Ned Explain[C]//Proceeding of the 17th International Conferenece on Extending Database Techno-logy.2014:145-156.
[18]HUANG J,CHEN T,DOAN A H,et al.On the provenance of non-answers to queries over extracted data[J].Proceedings of the Endowment,2008,1(1):736-747.
[19]HERSCHEL M,HERNÁNDEZ M A,TAN W C.Artemis:Asystem for analyzing missing answers [J].Proceedings of the Endowment,2009,2(2):1550-1553.
[20]HERSCHEL M,HERNÁNDEZ M A.Explaining missing an-swersto SPJUA queries [J].Proceedings of the VLDB Endowment,2010,3(1/2):185-196.
[21]ZONG C,YANG X,WANG B,et al.Minimizing explanations for missing answers to queries on databases[C]//Database Systems for Advanced Applications.2013:254-268.
[22]HERSCHEL M.Wondering why data are missing from queryresults:Ask conseil why-not[C]//Proceedings of the 22nd ACM International Conference on Information & Knowledge Management.2013:2213-2218.
[23]HERSCHEL M.A hybrid approach to answering why-not questions on relational query results[J].Data and InformationQua-lity,2015,5(3):1-29.
[24]CATE B T,CIVILI C,SHERKHONOV E,et al.High-levelwhy-not explanations using ontologies[J].arXiv:1412.2332,2015.
[25]CALVANESE D,ORTIZ M,SIMKUS M,et al.Reasoningabout explanations for negative query answers in DL-lite[J].Journal of Artificial Intelligence Research,2013,48:635-669.
[26]BIDOIT N,HERSCHEL M,TZOMPANAKI A.Efficient computationof polynomial explanations of why-not questions[C]//Proceedings of the18th ACM International Conference on Information & Knowledge Management.2015:713-722.
[27]XIAO Y M,GAO Y J.On Efficiently Answering Why-NotRange-Based Skyline Queries in Road Networks[J].IEEE Transactions on Knowledge and Data Engineering,2018,30(9):1697-1711.
[28]DELLIS E,SEEGER B.Efficient Computation of Reverse Skyline Queries[C]//Proceeding of the International Conference on Very Large Data Bases.2007:291-302.
[29]LIAN X,CHEN L.Reverse Skyline Search in Uncertain Databases[J].ACM Transactions on Database Systems(TODS),2010,35(1):1-49.
[30]GUO W,GUO J,HU Z Y.Spatial database index technology[M].Shanghai:Shanghai Jiaotong University Press,2006.
[31]GAO Y,LIU Q,ZHENG B,et al.On efficient reverse skyline query processing[J].Expert Systems with Applications,2014,41(7):3237-3249.
[32]ISLAM M S,ZHOU R,LIU C F.On answering why-not questions in reverse skyline queries[C]//IEEE ICDE.2013:973-984.
[33]BAGUS J S,TOSCA Y C.Answering why-not questions on reverse Skyline queries over incomplete data[J].JUTI,2019,17(1):84-93.
[34]LEE K C,LEE W C,ZHENG B,et al.ROAD:A new spatialobject search framework for road networks[J].IEEE Transactions on Knowledge and Data Engineering,2012,24(3):547-560.
[1] 陈志文, 王坤, 周广蕴, 王旭, 张晓丹, 朱虎明.
基于胶囊网络及其权重剪枝的SAR图像变化检测方法
SAR Image Change Detection Method Based on Capsule Network with Weight Pruning
计算机科学, 2021, 48(7): 190-198. https://doi.org/10.11896/jsjkx.200800225
[2] 李杉, 许新征.
基于双角度并行剪枝的VGG16优化方法
Parallel Pruning from Two Aspects for VGG16 Optimization
计算机科学, 2021, 48(6): 227-233. https://doi.org/10.11896/jsjkx.200800016
[3] 刘泽邦, 陈荦, 杨岸然, 李思捷.
面向矢量线数据的直线形状空间检索方法
Space Retrieval Method to Retrieve Straight Line for Vector Line Data
计算机科学, 2021, 48(11A): 117-123. https://doi.org/10.11896/jsjkx.210100084
[4] 孙彦丽, 叶炯耀.
基于剪枝与量化的卷积神经网络压缩方法
Convolutional Neural Networks Compression Based on Pruning and Quantization
计算机科学, 2020, 47(8): 261-266. https://doi.org/10.11896/jsjkx.190700062
[5] 熊亭, 戚湧, 张伟斌.
基于DCGRU-RF模型的路网短时交通流预测
Short-term Traffic Flow Prediction Based on DCGRU-RF Model for Road Network
计算机科学, 2020, 47(5): 84-89. https://doi.org/10.11896/jsjkx.190100213
[6] 韩京宇, 许梦婕, 朱曼.
路网上基于时空锚点的移动对象群体和个体运动监测方法
Detecting Group-and-individual Movements of Moving Objects Based on Spatial-Temporal Anchors of Road-network
计算机科学, 2020, 47(11): 294-303. https://doi.org/10.11896/jsjkx.191100083
[7] 王妍, 韩笑, 曾辉, 刘荆欣, 夏长清.
边缘计算环境下服务质量可信的任务迁移节点选择
Task Migration Node Selection with Reliable Service Quality in Edge Computing Environment
计算机科学, 2020, 47(10): 240-246. https://doi.org/10.11896/jsjkx.190900054
[8] 张彤,秦小麟.
时间依赖路网上的移动对象K近邻查询算法
K Nearest Neighbors Queries of Moving Objects in Time-dependent Road Networks
计算机科学, 2020, 47(1): 79-86. https://doi.org/10.11896/jsjkx.181102231
[9] 阮子瑞,阮中远,沈国江.
基于交通路网的TASEP模型的扩展研究
Study of TASEP Model Based on Road Networks
计算机科学, 2020, 47(1): 265-269. https://doi.org/10.11896/jsjkx.181202418
[10] 孙中锋, 王静.
用于基于方面情感分析的RCNN-BGRU-HN网络模型
RCNN-BGRU-HN Network Model for Aspect-based Sentiment Analysis
计算机科学, 2019, 46(9): 223-228. https://doi.org/10.11896/j.issn.1002-137X.2019.09.033
[11] 周剑刚, 秦小麟, 张珂珩, 许建秋.
基于道路网的多移动用户动态Skyline查询
Dynamic Skyline Query for Multiple Mobile Users Based on Road Network
计算机科学, 2019, 46(9): 73-78. https://doi.org/10.11896/j.issn.1002-137X.2019.09.009
[12] 柴欣, 高一寒, 武优西, 刘靖宇.
基于密度约束的对比模式挖掘
Distinguishing Patterns Mining Based on Density Constraint
计算机科学, 2019, 46(12): 26-30. https://doi.org/10.11896/jsjkx.181202289
[13] 李佳佳, 沈盼盼, 夏秀峰, 刘向宇.
时间依赖路网中反向 k近邻查询
Reverse k Nearest Neighbor Queries in Time-dependent Road Networks
计算机科学, 2019, 46(1): 232-237. https://doi.org/10.11896/j.issn.1002-137X.2019.01.036
[14] 毛莺池,陈杨.
不确定性车辆路口的轨迹预测
Uncertain Vehicle Intersection Trajectory Prediction
计算机科学, 2018, 45(3): 235-240. https://doi.org/10.11896/j.issn.1002-137X.2018.03.037
[15] 董天阳, 尚跃辉, 程强.
方向感知的路网移动对象范围查询算法
Direction-aware Moving Object Range Query Algorithm in Road Network
计算机科学, 2018, 45(11): 210-219. https://doi.org/10.11896/j.issn.1002-137X.2018.11.033
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!