Dr. Amjad M. Daoud

 

Arnet Miner page  Research Interests  Highest-cited paper:
 Amjad M. Daoud  Intelligent Systems / Artificial Intelligence

 Information Retrieval / Probabilistic Indexing 

 Effective Retrieval,

 (Order Preserving) (Minimal )Perfect Hash Functions

  Practical Minimal Perfect Hash Functions for Large Databases   (1992) at Commun. ACM (Cited By 99)

 

 

 

 

Selected Publications, Expertise and Rank:

  1. Recent Innovations in Compuational Intelligence, Jordan ACM ISWSA Professional Chapter, 2011.
  2. Proceedings of the CICEM2011, Jordan ACM ISWSA Professional Chapter, Sept 5-7, 2011.
  3. Performance Analysis of the Proposed Adaptive Gentle Random Early Detection Method Under Non Congestion and Congestion Situations, The International Conference on Digital Enterprise and Information Systems (DEIS). Communications in Computer and Information Science (CCIS), Springer-Verlag Berlin Heidelberg 2011, pp. 592-603, London, U.K, 2011.
  4. Efficient Non-Quadratic Quick Sort(NQQuickSort), The International Conference on Digital Enterprise and Information Systems (DEIS). Communications in Computer and Information Science (CCIS), Springer-Verlag Berlin Heidelberg 2011, pp. 667-675, London, U.K, 2011.
  5. Augmented Order Preserving Minimal Perfect Hash Functions for Very Large Digital Libraries, Proceedings of the 15th WSEAS International Conference on Communications, pp. 90-95, ISBN: 978-1-61804-018, Corfu Island, Greece, Jul. 14-17, 2011.
  6. Effective Web and Desktop Retrieval with Enhanced Semantic Spaces. Communications in Computer and Information Science 2010, Volume 117, 1-10, DOI: 10.1007/978-3-642-17578-7_1 , Advances in Software Engineering, Communications in Computer and Information Science, editors: Kim, Tai-hoon and Kim, Haeng-Kon and Khan, Muhammad Khurram and Kiumi, Akingbehin and Fang, Wai-chi and ?l?zak, Dominik, publisher: Springer Berlin Heidelberg, isbn: 978-3-642-17578-7; pages: 1-10, volume 117, doi: http://dx.doi.org/10.1007/978-3-642-17578-7_1
  7. Effective Ranked Desktop Retrieval, The 3rd IEEE International Conference on Ubi-media Computing (U-Media 2010), July 5-7, 2010, Zhejiang Normal University, Jinhua, China.
  8. Efficient Data Structures for Information Retrieval, available from LAP Lambert Academic Publishing AG & Co. KG Dudweiler Landstraße 99 66123 Saarbrcken Germany, 2010.
  9. Effective Ranked Desktop Retrieval, The 3rd IEEE International Conference on Ubi-media Computing (U-Media 2010), July 5-7, 2010, Zhejiang Normal University, Jinhua, China.

  10. Morphological Analysis and Diacritical Arabic Text Compression, The International Journal of ACM JORDAN, Vol.1, No.1, March 2010.

  11. e-Saf Moodle LMS in Saudi Higher Education: Implementation and Experiences, The Fourth Annual Conference of Learning International Networks Consortium (LINC),  2007.
  12. Perfect Hash Functions for Large Dictionaries, ACM Sixteenth Conference on Information and Knowledge Management (CIKM), Lisboa, Portugal, Nov. 2007.
  13. Effective Ranked Conceptual Retrieval, ACM Sixteenth Conference on Information and Knowledge Management (CIKM), Lisboa, Portugal, Nov. 2007.
  14. Perfect Hash Functions for Large Web Repositories, The Seventh International Conference on Information Integration and Web Based Applications & Services (iiWAS2005) , Kuala Lumpur, Malaysia, Sept. 2005; free copy.
  15. Dynamic Inverted Lists for Searching the WEB, The Seventh International Conference on Information Integration and Web Based Applications & Services (iiWAS2005) , Kuala Lumpur, Malaysia, Sept. 2005.
  16. Integrating IR and RDBMS Using Cooperative Indexing, Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Seattle, Washington, USA, July 1995 (Special Issue of the SIGIR Forum). ACM Press, ISBN 0-89791-714-6.
  17. Order-preserving minimal perfect hash functions and information retrieval, ACM Transactions on Information Systems (TOIS), 9(1), Jan 1991; free copy, available from eprints.cs.vt.edu. OCLC number: 450981700.
  18. Development of a modern OPAC: from REVTOLC to MARIAN,  Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval, Pittsburgh, Pennsylvania, USA, 1993, ISBN:0-89791-605-0; available from eprints.cs.vt.edu.
  19. Efficient Data Structures for Information Retrieval, PhD. Thesis, Virginia Polytechnic Institute & State University, Blacksburg, Virginia, 1993; scholar.lib.vt.edu: free copy; OCLC Number: 29179633. Published by: University Microfilms Int./UMI, 1994.
  20. Practical Minimal Perfect Hash Functions for Large Databases, Communications of the ACM (CACM), 35(1), Jan. 1992; available from eprints.cs.vt.edu. OCLC number: 449101969.
  21. Performance of some CFD codes on the Alliant FX/8, 1988; OCLC Number: 449101342.

Minimal Perfect Hashing Resources

Presentation

 CICEM2013 Minimal Perfect Hashing Tutorial (powerpoint presentation)(HTML).
 

Publications

C/C++ Code

Python Code

Javascript Code

Applications

The algorithm is used to compute Google page rank Google Page Rank in C#; many derivatives of the original algorithm: 

1. Fuzzy Tolerant Search with DWAGs and MPHF
2. CMPH Library cmph.sourceforge.com, 
3. MPHF in C# 
4. http://burtleburtle.net/bob/ha  sh/perfect.html (splits keys into buckets by a first h1, sorts buckets by size, maps them in decreasing order so table[hash1(key)] ^ hash2(key) causes no collision).

Citations from around the Web

Search Engine
Google Scholar
ACM Digital Library
DBLP
Google
Bing
Citeseer
Interaction Design
Microsoft Research
Entity Cube Microsoft Research
OCLC
http://researchr.org/