Search for Topics All Reviews
	Browse All Reviews > Data (E) > Data Storage Representations (E.2) > Hash-Table Representations (E.2...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 37 Reviews about "Hash-Table Representations (E.2...)": Date Reviewed   A complete guide to PivotTables: a visual approach Cornell P.,  APress, LP, Berkeley, CA, 2004. 368 pp. Type: Book Having sat through several workshops where the presenters gave a number of examples of, and reasons for, using Excel’s PivotTables, I was very interested in reviewing a book on the subject. How could anyone find enough material to write ... Jan 6 2006   Introduction to algorithms Cormen T., Leiserson C., Rivest R., Stein C.,  MIT Press, Cambridge, MA, 2001. 1179 pp. Type: Book This is an excellent introduction to a fundamental area of computer science: algorithms. It covers a significant number of algorithms rigorously, including techniques for their design and analysis.... Apr 23 2002   How to sign digital streams Gennaro R., Rohatgi P.  Information and Computation 165(1): 100-116, 2001. Type: Article The authors present methods to cryptographically sign finite and infinite length digital streams while reducing computational requirements of previous methods. The authors divide the stream into blocks and embed the signing information in... Dec 1 2001   Data structures and algorithm analysis in C (2nd ed.) Weiss M.,  Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997.Type: Book Weiss’s well-written, informative, and up-to-date textbook is essentially similar to the previous edition in C [1] and other versions in C++ and Ada [2,3]. Like the others, the C version is strong on the analysis of algorithms and extremely ... Feb 1 1998   Recursive hashing functions for n-grams Cohen J.  ACM Transactions on Information Systems 15(3): 291-320, 1997. Type: Article An n-gram is a sequence of n consecutive symbols taken from a stream of symbols, such as a document. In several contexts, such as indexing, retrieval, and comparison, it is necessary to hash-code every such... Nov 1 1997   LH*--a scalable, distributed data structure Litwin W., Neimat M., Schneider D.  ACM Transactions on Database Systems 21(4): 480-525, 1996. Type: Article Linear hashing (LH) is a directoryless, dynamic hashing technique developed by Litwin. LH* is a generalization of LH that allows for hashing in a distributed environment.... Oct 1 1997   Implicit O(1) probe search Fiat A., Naor M.  SIAM Journal on Computing 22(1): 1-10, 1993. Type: Article An implicit search technique is based on a table organization that requires no additional storage. In this case, if n is the table size and m is the domain size of the stored elements, with... Mar 1 1995   A faster algorithm for constructing minimal perfect hash functions Fox E., Chen Q., Heath L.  Research and development in information retrieval (Proceedings of the 15th annual international ACM SIGIR conference, Copenhagen, Denmark,  Jun 21-24, 1992) 266-273, 1992. Type: Proceedings A new algorithm for finding minimal perfect hash functions that require small amounts of hash table storage (as little as 2.4 bits per key) is described. Hash functions in this context are used to provide direct keyed access to database records.... Aug 1 1994   Differential cryptanalysis of the data encryption standard Biham E., Shamir A.,  Springer-Verlag, London, UK, 1993.Type: Book A cryptanalytic method of attack called “differential cryptanalysis” is described in this compact but useful book. The attack is applicable to a variety of cryptographic systems, and the book shows how it can be used with full... Feb 1 1994   Rule-based optimization and query processing in an extensible geometric database system Becker L., Güting R.  ACM Transactions on Database Systems 17(2): 247-303, 1992. Type: Article Meeting the needs of new application domains, such as office information systems, CAD databases, and geographic database systems, has become an overriding concern of database systems research. Extensible (or customizable) database systems are one ... Dec 1 1993       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2010 Reviews.com Terms of Use | Privacy Policy