期刊文献+

一种基于决策树的选择查询算法

下载PDF
导出
摘要 本文提出了一种基于决策树的查询索引结构,笔者称之为查询决策树。查询决策树不仅利用了查询内各个谓词间的合取关系,还充分利用了单个属性上的谓词索引。
出处 《中国科技信息》 2012年第3期73-73,77,共2页 China Science and Technology Information
  • 相关文献

参考文献1

二级参考文献30

  • 1Xu, Ke, Wu, Jian-ping, Wu, Jian. The analysis and design of fast route lookupalgorithms for high performance router. In: Kim, Kiseon, ed. Proceedings of the IEEEInternational Conference on ATM. San Francisco: IEEE Computer Society Press, 2001. 320~325.
  • 2Srinivasan, V. Fast and efficient Internet lookups [Ph.D. Thesis]. WashingtonUniversity, 1999.
  • 3Rekhter, Y., Li, T. An Architecturefor IP Address Allocation with CIDR. RFC 1518, 1993.
  • 4Fuller, V., Li, T., Yu, J., et al. Classless Inter-domain Routing (CIDR): anAddress Assignment and Aggregation Strategy. RFC 1519, 1993.
  • 5Hinden, R., Deering, S. IP Version 6 Addressing Architecture. RFC 2373, 1998.
  • 6Partridge, C. Locality and route caches. In: Claffy, K., Garrett, M., Braun, H.-W.,eds. Proceedings of the NSF workshop on Internet Statistics Measurement and Analysis.Diego, CA: NSF Press, 1996. 32~34.
  • 7Morrison, D.R. PATRICIA--practical algorithm to retrieve information coded inalphanumeric. Journal of the ACM, 1968, 15(4):514~534.
  • 8Sklower, Keith. A tree-based routing table for Berkeley Unix. Technical Report,Berkeley: University of California, 1993.
  • 9Internet routing table statistics. In: Saha, Debanjan, ed. Proceedings of the IEEEINFOCOM. San Francisco: IEEE Computer Society Press, 2001. 1444~1453.http://www.merit.edu/ipma/routing_table.
  • 10Cheung, G., McCanne, S. Optimal routing table design for IP address lookups undermemory constraints. In: Ephremides, A., Tripathi, S., eds. Proceedings of the IEEEINFOCOM. San Francisco: IEEE Computer Society Press, 1999. 1437~1444.

共引文献42

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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