期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于不确定数据的top-k概率相互最近邻查询 被引量：2

Top-k probabilistic mutual nearest neighbor query on uncertain data
下载PDF
导出
摘要 不确定数据上的概率相互最近邻查询具有重要的实际应用,针对目前关于这方面的研究尚少,提出了不确定数据上的概率相互最近邻的top-k查询算法。首先对问题进行描述与定义,其次总结可行的裁剪规则,从而裁剪查询对象中未计算的实例点。通过实验表明,该算法能有效地降低最近邻查询中的I/O开销,提高查询的响应速度。 Probabilistic mutual nearest neighbors query has important practical applications,but there are few researches about this problem so far.This paper proposed an algorithm to find the top-k probabilistic mutual nearest neighbors on uncertain data.First,described and formalized the problem.Second,proposed some pruning rules to cut some instances that were not need to be accessed in the query object.As the experimental results show that this algorithm can reduce the I/O cost effectively,and improve the response speed.
作者 梁瑜 张剡 周嵩 柏文阳
机构地区 南京大学计算机科学与技术系计算机软件新技术国家重点实验室
出处 《计算机应用研究》 CSCD 北大核心 2011年第7期2485-2487,2491,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(60721002) 国家"863"计划资助项目(2007AA01Z178)
关键词 空间查询 不确定数据 概率相互最近邻 反向最近邻 查询处理 spatial query uncertain data mutual nearest neighbor reverse nearest neighbor query processing
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献14

  • 1CHEN Jin-chuan, CHENG R. Efficient evaluation of imprecise location-dependent queries [ C ]//Proc of the 23rd International Conference on Data Engineering. 2007:586-595.
  • 2TAO Yu-fei, XIAO Xiao-kui, CHENG R. Range search on i'nultidimensional uncertain data[ J]. ACM Trans on Database Systems, 2007,32 ( 1 ) : 1-54.
  • 3ISHIKAWA Y, IIJ1MA Y, YU J X. Spatial range querying for Gaussian-based imprecise query objects[ C]//Proc of the 25th International Conference on Data Engineering. 2009: 676-687.
  • 4CHENG R,PRABHAKAR S, KALASHNIKOV D V. Querying imprecise data in moving object environments[ J]. IEEE Trans on Knowledge and Data Engineering ,2004,16 (9) : 1112-1127.
  • 5CHENG C K, CI-IEN Jin-chuan, MOKBEL M, et al. Probabilistic veritiers: evaluating constrained nearest neighbor queries over uncertain data[ C]//Proc of the 24th International Conference on Data Engineering. 2008:973-982.
  • 6IIJIMA Y, ISHIKAWA Y. Finding probabilistic nearest neighbors for query objects with imprecise locations[ C ]//Proc of the 10th International Conference on Mobile Data Management:Systems, Services and Middleware. 2009 : 52-61.
  • 7CHEEMA M A, LIN Xue-min, WANG Wei, et al. Probabilistic reverse nearest neighbor queries on uncertain data[ J]. IEEE Trans on Knowledge and Data Engineering,2010,22(4) :550-564.
  • 8PEI Jian, JIANG Bin,Lin Xue-min, et al. Probabilistic skyline on uncertain data [ C ]//Proc of the 33rd International Conference on Very Large Data Bases. 2007:15-26.
  • 9SOLIMAN M A, ILYAS I F, CHANG C K. Top-k query processing in uncertain databases [ C ]//Proc of the 25th International Conference on Data Engineering. 2007:896-905.
  • 10崔斌,卢阳.基于不确定数据的查询处理综述[J].计算机应用,2008,28(11):2729-2731. 被引量：12

二级参考文献20

  • 1SILBERSTEIN A, BRAYNARD R, ELLIS C, et al. A sampling-based approach to optimizing top-k queries in sensor networks[ C]// Proceedings of the 22nd International Conference on Data Engineering. Washington, DC: IEEE Computer Society, 2006:68.
  • 2CHENG R, PRABHAKAR S, KALASHNIKOV D V. Querying imprecise data in moving object environments[ C]// Proceedings of the 19th International Conference on Data Engineering. Washington, DC: IEEE Computer Society, 2003:723 - 725.
  • 3CHENG R, KALASHNIKOV D. PRABHAKAR S. Querying imprecise data in moving object environments[ J]. IEEE Transactions on Knowledge and Data Engineering, 2004, 16(9):1112 -1127.
  • 4CHEN L, OZSU M T, ORIA V. Robust and fast similarity search for moving object trajectories[ C]// Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 2005:491 -502.
  • 5LJOSA V, SINGH A K. APLA: Indexing arbitrary probability distributions[ C]// Proceedings of the 23rd Internalional Conierence on Data Engineering. Washington, DC: IEEE Computer Society, 2007:946 - 955.
  • 6CHENG R, XIA Y, PRABHAKAR S, et al. Efficient indexing methods for probabilistic threshold queries over uncertain data[ C]// Proceedings of the 30th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufmann, 2004:876-887.
  • 7TAO YU-FEI, CHENG R, XIAO XIAO-KUI, et al. Indexing multidimensional uncertain data with arbitrary probability density functions[ C]// Proceedings of the 31 st International Conference on Very, Large Data Bases. New York: ACM Press, 2005:922 -933.
  • 8SOLIMAN M A, ILYAS I F, CHANG K C C. Top-k query processing in unceriain databases[ C]// Proceedings of the 23rd International Conference on Data Engineering. Washington, DC: IEEE Computer Society, 2007:896 - 905.
  • 9HUA M, PEI J, ZHANG W, et al. Ranking queries on uncertain data: A probabilistlc threshold approach[ C]// Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 2008:673 -686.
  • 10PEI J, JIANG B. LIN X, et al. Probabilistic skylines on uncertain data[ C]// Proceedings of the 33 rd International Conference on Very Large Data Bases. New York: ACM Press, 2007:15 -26.

共引文献11

同被引文献23

  • 1HAWKINS D. Identification of outliers[ M]. London: Chapman and Hail, 1980.
  • 2KEOGH E, LIN J, FU A. HOT SAX :efficiently finding the most un- usual time series subsequence: algorithms and applications [ C ]//Proc of the 5th IEEE International Conference on Data Mining. Washington DC : IEEE Computer Society,2005:226-233.
  • 3CAMERRA A, PALPANAS T, SHIEH J, et al. iSAX 2.0: indexing and mining one billion time series[ C]//Proc of the 10th IEEE Inter- national Conference on Data Mining. 2010:58-67.
  • 4BUU H T Q, ANYI D T. Time series discord discovery based on iSAX symbolic representation[ C ]//Proc of the 3rd International Conference on Knowledge and System Engineering. 2011 : 11 - 18.
  • 5SOLIMAN M A, ILYAS I F. Ranking with uncertain scores [ C ]// Proc of the 25th IEEE International Conference on Data Engineering. Piscataway : IEEE Press,2009 : 317- 328.
  • 6CORMODE G, LI Fei-fei, YI Ke. Semantics of ranking queries for probabilistic data and expected ranks [ C ]//Proc of the 25th Interna- tional Conference on Data Engineering. Piscataway: IEEE Press, 2009:305-316.
  • 7LI Jian, DESHPANDE A. Ranking continuous probabilistic datasets [ J]. Proceedings of the VLDB Endowment, 2010, 3 (1-2 ): 638- 649.
  • 8MA Jun-shui, PERKINS S. Online novehy detection on temporal se- quences[ C ]//Proc of" the 9th ACM SIGKDD International Confm~nce on Knowledge Discovery and Data Mining. New York: ACM Press, 2003:613-618.
  • 9CHEEMA M A, LIN Xue-min, WANG Wei, et al. Prebabilistic reverse nearest neighbor queries on uncertain data[J]. IEEE Trans on Knowledge and Data Engineering, 2010, 22 (4) : 550-564.
  • 10KORN F, MUTHUKRISHNAN S. Influence sets based on reverse nea- rest neighbor queries[J]. ACM SIGiMOD Record, 2000, 29(2) : 201-212.

引证文献2

二级引证文献2

计算机应用研究
2011年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部