Efficient searching techniques

Details Efficient searching techniques Efficient searching techniques

2005-07-25

2009-12-15

Alam, Hosain T (Department: 2166)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

07634470

ABSTRACT:
The present invention describes techniques for performing searches in an efficient manner while minimizing the memory resources required to perform the searches. According to the techniques of the present invention, the number of comparisons needed to determine if a query element is in included in a set of elements is proportional to the length of the query element and independent of the number of elements in the set of elements.

REFERENCES:
patent: 4606002 (1986-08-01), Waisman et al.
patent: 5202986 (1993-04-01), Nickel
patent: 5495609 (1996-02-01), Scott
patent: 5787430 (1998-07-01), Doeringer et al.
patent: 6014659 (2000-01-01), Wilkinson et al.
patent: 6131092 (2000-10-01), Masand
patent: 6182069 (2001-01-01), Niblack et al.
patent: 6230154 (2001-05-01), Raz et al.
patent: 6240418 (2001-05-01), Shadmon
patent: 6249788 (2001-06-01), Ronstrom
patent: 6353823 (2002-03-01), Kumar
patent: 6363488 (2002-03-01), Ginter et al.
patent: 6389412 (2002-05-01), Light
patent: 6427140 (2002-07-01), Ginter et al.
patent: 6614789 (2003-09-01), Yazdani et al.
patent: 6675173 (2004-01-01), Shadmon
patent: 6735595 (2004-05-01), Gobeille et al.
patent: 2002/0103809 (2002-08-01), Starzl et al.
patent: WO 02/057883 (2002-07-01), None
patent: WO 02/057883 (2002-07-01), None
Dietzfelbinger et al., “Polynomial hash functions are reliable,”Proc. ICALP 1992, pp. 235-246.
Faloutsos, C., “Access methods for text,”ACM Computing Surveys, 17(1):49-74 (1985).
Gonnet et al.,Handbook of Algorithms and Data Structures, pp. 130-133, Addison-Wesley, Reading, MA (1991).
Horwitz et al.,Computer Algorithms, pp. 131-137, W. H. Freeman Press (1998).
Manber et al., “GLIMPSE: A tool to search through entire file systems,” Technical Report 93-94, Department of Computer Science, The University of Arizona, Tucson, Oct. 1993.
Knuth, D. E.,The Art of Computer Programming vol. 3: Sorting and Searching, pp. 481-485, Addison-Wesley Publishers (1976).
Perl et al., “Interpolation Search—A Log LogNSearch,”Communications of the ACM, 21(7):550-553 (1978).
Salton et al.,Introduction to Modern Information Retrieval, McGraw-Hill, New York, 1983. [section related to description of index files].
Van Emde Boas et al., “Design and Implementation of an Efficient Priority Queue,”Mathematical Systems Theory, 10:99-127 (1977).
Wu et al., “Agrep—a fast approximate pattern-matching tool,”Proc. Usenix Winter 1992 Technical Conference, pp. 153-162 held in San Francisco Jan. 1992.
Wu et al., “Fast Text Searching Allowing Errors,”Communications of the ACM, 35:83-91 (1992).
Oracle, “Oracle Internet Filesystem (iFS) FAQ,” downloaded from http://www.orafaq.com/faqifs.htm, 3 pages, Dec. 18, 2000.

Affiliated with

Also associated with

Rating

Efficient searching techniques does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient searching techniques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient searching techniques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4098084