检索命令加工的优化  

Optimization of Retrieval Commands Processing

作　　者：邢海良[1] 徐良贤[1] 

机构地区：[1]上海交通大学计算机科学与工程系

出　　处：《上海交通大学学报》1997年第8期25-27,共3页Journal of Shanghai Jiaotong University

摘　　要：讨论了如何对文献检索命令进行空间和时间上的优化，提出了用检索树法和ＤＡＧ图法取代传统的逆波兰转换．新方法在空间和时间上效率都有明显改善。The time and space optimization of processing retrieval commands in an information retrieval system is proposed.A new method named Retrieval Tree is provided which is superior to traditional Reversed Polish Notation method in time and space performance.A more advanced method named DAG is also provided which can avoid the repeated retrievals.Both Retrieval Tree and DAG methods are adapted to the parallel optimization.

关 键 词：全文检索 检索树 文献检索系统 检索命令 

分 类 号：TP391.3[自动化与计算机技术—计算机应用技术] G354.4[自动化与计算机技术—计算机科学与技术]