Speeding up keyword search for search engines

Proceedings of the Third IASTED International Conference on Communications, Internet, and Information Technology

Volumn , Issue , 2004, Pages 255-260

  Baberwal, Sanjay ^a   Choi, Ben ^a  

^a Louisiana Tech University   (United States)

Author keywords

Information storage and retrieval; Information system and the internet, search engine; Text indexing

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GLOSSARIES; HEURISTIC METHODS; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; INTERNET; TREES (MATHEMATICS);

BINARY SEARCH TREES; INFORMATION STORAGE AND RETRIEVAL; INFORMATION SYSTEM AND THE INTERNET; TEXT INDEXING;

SEARCH ENGINES;

EID: 11144267263     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, Massachusetts, 1983.
2. Steffen Heinz, Justin Zobel, and Hugh E. Williams, Burst Tries: A Fast, Efficient Data Structure for String Keys. ACM Transactions on Information Systems, 20(2): 192-223, 2002.
3. M. Al-Suwaiyel and E. Horowitz. Algorithms for trie compaction. ACM Transactions on Database Systems, 9(2):243-263, 1984.
4. A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Information Processing Letters, 46(6):295-300, June 1993.
5. J.-I. Aoe, K. Morimoto, and T. Sato. An efficient implementation of trie structures. Software Practice and Experience, 22(9):695-721, September 1992.
6. J.-I. Aoe, K. Morimoto, M. Shishibori, and K.-H. Park. A trie compaction algorithm for a large set of keys. IEEE Transactions on Knowledge and Data Engineering, 8(3):476-491, 1996.
7. R. A. Baeza-Yates and G. Gonnet. Fast text searching for regular expressions or automaton searching on tries. Jour. of the ACM, 43(6):915-936, 1996.
8. J. Clement, P. Flajolet, and B. Vallee. The analysis of hybrid trie structures. In Proc. Annual ACM-SIAM Symp. on Discrete Algorithms, pages 531-539, San Francisco, California, 1998. ACM/SIAM.
9. R. de la Briandais. File searching using variable length keys. In Proc. Western Joint Computer Conference, volume 15, Montvale, NJ, USA, 1959. AFIPS Press.
10. P. Flajolet. On the performance evaluation of extendible hashing and trie searching. Acta Informatica, 20:345-369, 1983.
11. E. M. McCreight. A space-economical suffix tree construction algorithm. Jour. of the ACM, 23(2):262-271, 1976.
12. D. R. Morrison. Patricia: a practical algorithm to retrieve information coded in alphanumeric. Jour. of the ACM, 15(4):514-534, 1968.
13. M. V. Ramakrishna and J. Zobel. Performance in practice of string hashing functions. In R. Topor and K. Tanaka, editors, Proc. Int. Conf. on Database Systems for Advanced Applications, pages 215-223, Melbourne, Australia, April 1997.
14. R. Ramesh, A. J. G. Babu, and J. Peter Kincaid. Variable-depth trie index optimization: Theory and experimental results. ACM Transactions on Database Systems, 14(1):41-74, 1989.
15. I. H. Witten and T. C. Bell. Source models for natural language text. Int. Jour. on Man Machine Studies, 32:545-579, 1990.
16. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco, California, second edition, 1999.
17. J. Zobel, S. Heinz, and H. E. Williams. In-memory hash tables for accumulating text vocabularies. Information Processing Letters.
18. W. Szpankowski. Patricia tries again revisited. Jour. of the ACM, 37(4):691-711, 1990.
19. W. Szpankowski. On the height of digital trees and related problems. Algorithmica, 6:256-277, 1991.
20. W. Szpankowski. Average case analysis of algorithms on sequences. John Wiley and Sons, New York, 2001.
21. M. Regnier and P. Jacquet. New results of the size of tries. IEEE Transactions on Information Theory, 35(1):203-205, January 1989.
22. D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Jour. of the ACM, 32:652-686, 1985.
23. S. Nilsson, M. Tikkanen. Implementing a dynamic compressed trie. In Mehlhorn K editor, Proceedings of the 2nd Workshop on Algorithm Engineering (WAE'98), 25-36, Aug 20-22, 1998
24. Puzzler.org, ftp://puzzlers.org/pub/wordlists/web2.txt
25. B. Choi and X. Peng, "Dynamic and Hierarchical Classification of Web Pages," Online Information Review, Vol. 28, No. 2, 2004.
26. B. Choi and R. Dhawan, "Agent Space Architecture for Search Engines," IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004.
27. B. Choi and Q. Guo, "Applying Semantic Links for Classifying Web Pages," Developments in Applied Artificial Intelligence, IEA/AIE 2003, Lecture Notes in Artificial Intelligence, Vol. 2718, pp. 148-153, 2003
28. Z. Yao and B. Choi, "Bidirectional Hierarchical Clustering for Web Mining," IEEE/WIC International Conference on Web Intelligence, pp. 620-624, 2003.
29. X. Peng and B. Choi, "Automatic Web Page Classification in a Dynamic and Hierarchical Way," IEEE International Conference on Data Mining, pp. 386-393, 2002.
30. B. Choi, "Making Sense of Search Results by Automatic Web-page Classifications," WebNet 2001: World Conference on the WWW and Internet, pp. 184-186, 2001.