Patents Assigned to GlobalSpec, Inc.
-
Publication number: 20120260011Abstract: A method of buffered reading of data is provided. A read request for data is received by a buffered reader, and in response to the read request, a main memory input buffer is partially filled with the data by the buffered reader to a predetermined amount that is less than a fill capacity of the input buffer. Corresponding computer system and program products are also provided.Type: ApplicationFiled: April 30, 2012Publication date: October 11, 2012Applicant: GLOBALSPEC, INC.Inventors: Steinar Flatland, Mark Richard Gaulin
-
Patent number: 8205025Abstract: A method of buffered reading of data is provided. A read request for data is received by a buffered reader, and in response to the read request, a main memory input buffer is partially filled with the data by the buffered reader to a predetermined amount that is less than a fill capacity of the input buffer. Corresponding computer system and program products are also provided.Type: GrantFiled: August 11, 2010Date of Patent: June 19, 2012Assignee: GlobalSpec, Inc.Inventors: Steinar Flatland, Mark Richard Gaulin
-
Patent number: 8126877Abstract: Search engine results arranged according to one or more first criteria (e.g., relevancy) are obtained. The results are assigned groups within chosen or calculated relevancy ranges. The results are then resorted within each group according to one or more second criteria (e.g., payment). The groups maintain original placement relative to each other during resorting. A list of at least some of the resorted results is then created for various uses, including search or further manipulation.Type: GrantFiled: January 23, 2008Date of Patent: February 28, 2012Assignee: GlobalSpec, Inc.Inventors: Richard Karl Hansen, Kevin D. Carey, Nilanjana De, Mark Richard Gaulin
-
Patent number: 8065283Abstract: Synonyms for a term to be indexed are dynamically generated by applying one or more rules (e.g., splitting, deletion or addition of characters, and concatenation of portions) to the term, each synonym generated either including only a portion and not all of the term or differing from the term by at least one additional character in a position between a first character and a last character (i.e., not at either end of the term). The term and some or all of the synonyms are then indexed for subsequent searching.Type: GrantFiled: January 24, 2008Date of Patent: November 22, 2011Assignee: GlobalSpec, Inc.Inventors: Nilanjana De, Richard Karl Hansen
-
Publication number: 20110040761Abstract: The present invention provides a method of minimizing accesses to secondary storage when searching an inverted index for a search term. The method comprises automatically obtaining a predetermined size of a posting list for the search term, the predetermined size based on document frequency for the search term, wherein the posting list is stored in secondary storage, and reading at least a portion of the posting list into memory based on the predetermined size. Corresponding computer system and program products are also provided.Type: ApplicationFiled: August 11, 2010Publication date: February 17, 2011Applicant: GLOBALSPEC, INC.Inventors: Steinar Flatland, Jeff J. Dalton
-
Publication number: 20110040905Abstract: A method of buffered reading of data is provided. A read request for data is received by a buffered reader, and in response to the read request, a main memory input buffer is partially filled with the data by the buffered reader to a predetermined amount that is less than a fill capacity of the input buffer. Corresponding computer system and program products are also provided.Type: ApplicationFiled: August 11, 2010Publication date: February 17, 2011Applicant: GLOBALSPEC, INC.Inventors: Steinar Flatland, Mark Richard Gaulin
-
Publication number: 20110040762Abstract: A size of a posting list is determined as part of searching an inverted index. The posting list is segmented for reading into a plurality of segments based on the size. For example, the segmenting may be performed if the size is larger than a predetermined size. Finally, each of the plurality of segments is read into memory.Type: ApplicationFiled: August 11, 2010Publication date: February 17, 2011Applicant: GLOBALSPEC, INC.Inventors: Steinar Flatland, Jeff J. Dalton
-
Publication number: 20090193008Abstract: Synonyms for a term to be indexed are dynamically generated by applying one or more rules (e.g., splitting, deletion or addition of characters, and concatenation of portions) to the term, each synonym generated either including only a portion and not all of the term or differing from the term by at least one additional character in a position between a first character and a last character (i.e., not at either end of the term). The term and some or all of the synonyms are then indexed for subsequent searching.Type: ApplicationFiled: January 24, 2008Publication date: July 30, 2009Applicant: GLOBALSPEC, INC.Inventors: Nilanjana De, Richard Karl Hansen
-
Publication number: 20090187557Abstract: Search engine results arranged according to one or more first criteria (e.g., relevancy) are obtained. The results are assigned groups within chosen or calculated relevancy ranges. The results are then resorted within each group according to one or more second criteria (e.g., payment). The groups maintain original placement relative to each other during resorting. A list of at least some of the resorted results is then created for various uses, including search or further manipulation.Type: ApplicationFiled: January 23, 2008Publication date: July 23, 2009Applicant: GLOBALSPEC, INC.Inventors: Richard Karl Hansen, Kevin D. Carey, Nilanjana De, Mark Richard Gaulin
-
Patent number: 7356533Abstract: In a distributed computer system, such as the World Wide Web portion of the Internet, a first computer requests to a second computer remote from the first computer to search information of at least one entity. The first computer indicates to a search agent associated with the second computer at least one search criterion for the search. The search agent accesses at least one database remote from the first and second computers that stores information of a number of entities, including the at least one entity. The at least one entity is less than all of the plurality of entities with information in the at least one database. A search based on the at least one search criterion is performed by the search agent only on the portion of the database related to the at least one entity.Type: GrantFiled: April 5, 1999Date of Patent: April 8, 2008Assignee: GlobalSpec, Inc.Inventors: Andrea M. Schneiter, John L. Schneiter, Mark R. Gaulin