期刊文献+

一种基于多重索引的大规模数据快速查找算法 被引量:2

Quick Search Approach to Large-scale Data Based on Multi-index
下载PDF
导出
摘要 在手持式设备移动计算中,为了实时获取信息,往往需要对数据进行高效查找,而这又与手持式设备较弱的计算处理功能相矛盾。从硬件体系与软件算法综合考虑角度出发,提出了一种基于大规模记录的索引快速查找算法。实践表明,该算法结合所设计的多层次硬件体系,能高效地实现数据快速定位查找。 To access real-time information with mobile hand processor from datum, quick search approach is adopted generally. However, there exists conflict between quick search capability demand and mobile device computing capability with weaker compute processing power. From the point of hardware architecture and software arithmetic, a quick search approach to large-scale record based on multi-index was proposed. The result shows that the proposed approach applied to the corresponding hardware architecture can increase location rate greatly.
作者 应俊 杨茂斌
出处 《计算机科学》 CSCD 北大核心 2009年第3期258-260,290,共4页 Computer Science
关键词 数据查找 索引算法 文本 大规模 Data search, Index arithmetic, Text, Large-scale
  • 相关文献

参考文献9

  • 1Guttman A. R trees : a dynamic index structure for spatial searching[J]. ACM SIGMOD Record Archive, 1984, 14(2) : 47-57
  • 2Robinson J T. The K - D - B - tree : a search structure for large multidimensional dynamic indexes//Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data. Ann Arbor, Michigan April 29-May 01, 1981
  • 3Song S I, Kim Y H, Yoo J S. An Enhanced Concurrency Control Scheme for Multidimensional Index Structures. IEEE Transactions on Knowledge and Data Engineering, 2004,16 (1):97-111
  • 4Moses S, Gruenwald L. Sealability of indexing structures in a production systems testbed for computational research. Computers and Industrial Engineering, 2005 ,48(1):97-109
  • 5Salton G , Buckley C. Parallel text search methods. Commun. ACM, 1988,31 (2) : 202-215
  • 6Stanfill C, Thau R,Waltz D. A parallel indexed algorithm for information retrieval. Technical Report DR90-2. Thinking Machines Corporation, Cambridge, Mass. , 1990
  • 7Stanfill C, Thau R, Waltz D. A parallel indexed algorithm for information retrieval. ACM SIGIR Forum, June 1989,23 (SI) : 88-97
  • 8Jaggar D. Arm Architecture And Systems. Micro, IEEE Publication Date, 1997,17 : 9-11
  • 9Seal D. ARM Architecture Reference Manual, 2nd edition. Addison-Wesley Longman Publishing Co. , Inc. Boston, MA, USA, 2000

同被引文献16

  • 1王磊.索引在查询优化中的作用[J].长春理工大学学报(高教版),2009(2):178-179. 被引量:1
  • 2马越,张大勇,金一丞.一种基于跳表的DDM相交区域快速查询算法[J].计算机仿真,2005,22(7):46-50. 被引量:2
  • 3Sikalinda P G,Walters L,Kritzinger P S.A storagesystem workload analyzer,CS06-02-00[R].CapeTown,University of Cape Town,2006.
  • 4Chanho Ryu,Eunmi Song et al.Hybrid-TH:a HybridAccess Mechanism for Real-Time Memory-ResidentDatabase Systems[C] //Real-Time Computing Systemand Applications.Proceeding of the Fifth InternationalConference.Hiroshima,IEEE.1998:303-310.
  • 5Lin X,Shroff N B.An optimization-based approach for QoSrouting in high-bandwidth networks[J].IEEE/ACMTransactions on Networking,2006,14(6):1348-1361.
  • 6Aspnes J,Shah G.Skip graphs[J].ACM Trans.onAlgorithms,2007,3(4):37.
  • 7Aspnes J,Wieder U.The expansion and mixing time ofskip graphs with applications[C] //ACM.In SeventeenthAnnual ACM Symposium on Parallelism in Algorithmsand Architectures.New York,ACM,2005:126-134.
  • 8John Risson,Tim Moors.Survey of research towardsrobust peer-to-peer networks:Search methods[J] Computer Networks,2006,50(17):3485-3521.
  • 9William Pugh.Skip lists:aprobabilistic alternative tobalanced trees[J].Communications of the ACM,1990,33(6):668-676.
  • 10Pugh W.Skip lists:aprobabilistic alternative to bal-anced trees[J].Communications of the ACM,1990,33(6):668-676.

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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