Patent US3858735A successfully refreshed from Google Patents.
Patent US5293552A successfully refreshed from Google Patents.
US5293552A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for storing bibliometric information on items from a finite source of text, and in particular document postings for use in a full-text document retrieval system
Assignee: US Philips Corp
•
Filing: 1992-03-30
•
Granted: 1994-03-08
•
Expires: 2012-03-30
Abstract
Abstract A method to compress, store, and retrieve bibliometric information on multiple sources of text is presented. The compression consists of 2 parts, and may use any one of the many ordering-based bibliometric laws for sources of text. The first compression part comprises of the storage of bibliometric information on the items from a text source, using the rank of the items in the ordering relation as defined in the bibliometric law as an indication of the bibliometric information. The second compression part efficiently uses pointers and tables to get rid of redundant information. As an application, a posting compression method is presented for use in term weighting retrieval systems. The first compression uses a postulated rank-occurrence frequency relation for the document in question that has as only variable the document's length, for example Zipf's law that states that the product of rank and frequency is approximately constant. The second compression part efficiently uses pointers and a few tables next to the principal storage. The compression makes use of direct random addressability. All postings relating to a particular document may be stored together, allowing easy expendability and updating. With respect to conventional technology, storage requirements is roughly halved.
Inventors
- 👤 Ijsbrand J. Aalbersberg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 23:34
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/30; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99935
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
139 words
In a computer-based information storage and retrieval system, a method for computer storing of bibliometric information on items in a finite source of text, using a postulated relationship between the bibliometric property of an item and its rank number in a linear ordering of all items in said source, said method comprising the steps of: a) computing and storing a linear ordering of all items including, for any item in said source, positioning it properly in the said linear ordering, each stored item in the linear ordering having a rank number, b) determining an item's rank number in the linear ordering, c) for any item in said source, storing the item's rank number as determined in step b) above as an indication of that item's bibliometric property, d) using the item's rank number for managing information about the source.
Claim 2
Dependent Claim
139 words
In a computer-based information storage and retrieval system, a method for computer storing of bibliometric information on items in a finite source of text, using a postulated relationship between the bibliometric property of an item and its rank number in a linear ordering of all items in said source, said method comprising the steps of: a) computing and storing a linear ordering of all items including, for any item in said source, positioning it properly in the said linear ordering, each stored item in the linear ordering having a rank number, b) determining an item's rank number in the linear ordering, c) for any item in said source, storing the item's rank number as determined in step b) above as an indication of that item's bibliometric property, d) using the item's rank number for managing information about the source.
Claim 3
Dependent Claim
113 words
A method as claimed in claim 1, further comprising: e) assigning to each item in a particular source a sequence number based on address mapping transform that is uniform among the said sources and preserves rank order, f) for each source, storing a sequence of tuples, each of which tuples is assigned to a unique item in its source, and each tuple comprising: (i) an identifier for a next successive source comprising the same unique item, (ii) an offset value indicating both that unique item's sequence number in the source so identified as well as that unique item's rank number in said linear ordering as an indication of that unique item's bibliometric property.
Claim 4
Dependent Claim
42 words
The method of claim 2, wherein the sources are documents each having lexical terms, and further comprising the step of assigning to each lexical term a weight indicating the relevance of that term in the document, and storing the thus assigned weight.
Claim 5
Independent Claim
208 words
A method for storing document postings in a computer-based full-text document retrieval system, said method using a postulated relationship between a lexical term's occurrence frequency rank and its nominal weight, said postulated relationship depending exclusively on this rank and on the number of different lexical terms in a particular document as variables, said method comprising the steps of: a) for any lexical term in a particular document, computing its occurrence frequency and therefrom said lexical term's rank in an occurrence frequency ordering of the terms, b) storing a normalization factor as governed by said postulated relationship, c) assigning to each lexical term in the particular document a sequence number based on standard address mapping transform that is uniform among said documents and preserving said rank order, d) for each document, storing a sequence of postings each assigned to a unique lexical term in the document according to its assigned sequence number, each posting comprising: (i) an identifier for a next successive document comprising the same unique term, (ii) an offset value operating as pointer in said next successive document while indicating said unique term's posting sequence number in said next successive document as well as a direct indication of that unique term's weight in the document so identified.
Claim 6
Independent Claim
208 words
A method for storing document postings in a computer-based full-text document retrieval system, said method using a postulated relationship between a lexical term's occurrence frequency rank and its nominal weight, said postulated relationship depending exclusively on this rank and on the number of different lexical terms in a particular document as variables, said method comprising the steps of: a) for any lexical term in a particular document, computing its occurrence frequency and therefrom said lexical term's rank in an occurrence frequency ordering of the terms, b) storing a normalization factor as governed by said postulated relationship, c) assigning to each lexical term in the particular document a sequence number based on standard address mapping transform that is uniform among said documents and preserving said rank order, d) for each document, storing a sequence of postings each assigned to a unique lexical term in the document according to its assigned sequence number, each posting comprising: (i) an identifier for a next successive document comprising the same unique term, (ii) an offset value operating as pointer in said next successive document while indicating said unique term's posting sequence number in said next successive document as well as a direct indication of that unique term's weight in the document so identified.
Claim 7
Dependent Claim
39 words
A method as claimed in claim 4, further comprising storing for each document a normalization factor (n) for thereby normalizing any offset received to a weight factor as dependent of the number of postings for the document in question.
Claim 8
Dependent Claim
30 words
A method as claimed in claim 5, wherein said weight is inversely proportional to the square root of the rank of occurrence frequency of the particular term in the sequence.
Claim 9
Independent Claim
133 words
A method for computer-accessing document postings in a computer-based full text retrieval system, said method comprising the steps of: a) entering for a document term a term identity representation, b) searching for an initial posting in a posting base table that has a document identifier and an offset, c) executing a program loop and while in each loop traversal, by means of a most recent document identifier and most recent offset, computing a next posting address, each posting so addressed containing a next document identifier and offset thereupon featuring as being most recent, d) and in each loop traversal also using its offset value found as a pointer and also as a weight representation number associated to said term in respect of its occurrence in the document associated to each respective loop traversal.
Claim 10
Independent Claim
133 words
A method for computer-accessing document postings in a computer-based full text retrieval system, said method comprising the steps of: a) entering for a document term a term identity representation, b) searching for an initial posting in a posting base table that has a document identifier and an offset, c) executing a program loop and while in each loop traversal, by means of a most recent document identifier and most recent offset, computing a next posting address, each posting so addressed containing a next document identifier and offset thereupon featuring as being most recent, d) and in each loop traversal also using its offset value found as a pointer and also as a weight representation number associated to said term in respect of its occurrence in the document associated to each respective loop traversal.
Claim 11
Dependent Claim
34 words
A method as claimed in claim 7, wherein said document identifier addresses a document base table for by means of adding of a document base pointer to an actual offset generating a posting address.
Claim 12
Dependent Claim
29 words
A method as claimed in claim 8, further by means of said document identifier addressing a weight normalization factor that combines with an associated offset to a weight quantity.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-03-07 | 1997-09-06 | 1998-03-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-03-07 | 2001-09-06 | 2002-03-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-03-07 | 2005-09-06 | 2006-03-08 | $7700.00 | Window Closed / Lapsed |