Hitmask for querying hierarchically related content entities

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C715S252000

Reexamination Certificate

active

06839701

ABSTRACT:
A web-based system, method and program product are provided for searching a content object (e.g., a custom compilation or prepublished work) stored in a data repository as a group of hierarchically related content entities. Each noncontainer content object is stored as a separate entity in the data repository. Each content entity is also stored as a row in a digital library index class as a collection of attributes and references to related content entities and containers. Each noncontainer content object is preferably stored as a separate entity in the data repository. Each content entity is also stored as a row in a digital library index class as a collection of attributes and references to related content entities. Each container and noncontainer is associated with a unique identifier that includes hierarchical information about its position in the hierarchy. Queries are executed on the hierarchical containers and noncontainers through an application or user-interface. The results of the independent searches are merged using hit masks. A hit mask is a string of bits, each bit representing a query. For each container and noncontainer in the result set, a hit mask is generated and ones of the bits are set to indicate which of the queries the container or noncontainer satisfies. Container hit masks are OR-ed with their child containers and/or noncontainers to reflect inheritance. Containers and noncontainers with all bits set comprise the merged result set.

REFERENCES:
patent: 3964029 (1976-06-01), Babb
patent: 4823306 (1989-04-01), Barbic et al.
patent: 5187786 (1993-02-01), Densmore et al.
patent: 5251315 (1993-10-01), Wang
patent: 5274757 (1993-12-01), Miyoshi et al.
patent: 5297039 (1994-03-01), Kanaegami et al.
patent: 5377348 (1994-12-01), Lau et al.
patent: 5388196 (1995-02-01), Pajak et al.
patent: 5454105 (1995-09-01), Hatakeyama et al.
patent: 5467471 (1995-11-01), Bader
patent: 5537586 (1996-07-01), Amram et al.
patent: 5557722 (1996-09-01), DeRose et al.
patent: 5579471 (1996-11-01), Barber et al.
patent: 5644736 (1997-07-01), Healy et al.
patent: 5644776 (1997-07-01), DeRose et al.
patent: 5664182 (1997-09-01), Nierenberg et al.
patent: 5664189 (1997-09-01), Wilcox et al.
patent: 5680619 (1997-10-01), Gudmundson et al.
patent: 5737599 (1998-04-01), Rowe et al.
patent: 5758351 (1998-05-01), Gibson et al.
patent: 5778378 (1998-07-01), Rubin
patent: 5778398 (1998-07-01), Nagashima et al.
patent: 5781189 (1998-07-01), Holleran et al.
patent: 5781732 (1998-07-01), Adams
patent: 5787413 (1998-07-01), Kauffman et al.
patent: 5806061 (1998-09-01), Chaudhuri et al.
patent: 5813000 (1998-09-01), Furlani
patent: 5847709 (1998-12-01), Card et al.
patent: 5848404 (1998-12-01), Hafner et al.
patent: 5848409 (1998-12-01), Ahn
patent: 5857203 (1999-01-01), Kauffman
patent: 5864870 (1999-01-01), Guck
patent: 5875446 (1999-02-01), Brown et al.
patent: 5890147 (1999-03-01), Peltonen et al.
patent: 5909688 (1999-06-01), Yoshioka et al.
patent: 5956715 (1999-09-01), Glasser et al.
patent: 5960411 (1999-09-01), Hartman et al.
patent: 5987242 (1999-11-01), Bentley et al.
patent: 5991756 (1999-11-01), Wu
patent: 5991758 (1999-11-01), Ellard
patent: 6003040 (1999-12-01), Mital et al.
patent: 6006242 (1999-12-01), Poole et al.
patent: 6012890 (2000-01-01), Celorio Garrido
patent: 6018627 (2000-01-01), Iyengar et al.
patent: 6026416 (2000-02-01), Kanerva et al.
patent: 6052528 (2000-04-01), Dechamboux
patent: 6055544 (2000-04-01), DeRose et al.
patent: 6065026 (2000-05-01), Cornelia et al.
patent: 6091930 (2000-07-01), Mortimer et al.
patent: 6098072 (2000-08-01), Sluiman et al.
patent: 6101500 (2000-08-01), Lau
patent: 6122641 (2000-09-01), Williamson et al.
patent: 6131100 (2000-10-01), Zellweger
patent: 6134552 (2000-10-01), Fritz et al.
patent: 6134594 (2000-10-01), Helland et al.
patent: 6134706 (2000-10-01), Carey et al.
patent: 6163781 (2000-12-01), Wess, Jr.
patent: 6173286 (2001-01-01), Guttman et al.
patent: 6173407 (2001-01-01), Yoon et al.
patent: 6178463 (2001-01-01), Houston et al.
patent: 6182082 (2001-01-01), Tanaka et al.
patent: 6199082 (2001-03-01), Ferrel et al.
patent: 6199197 (2001-03-01), Engstrom et al.
patent: 6211871 (2001-04-01), Himmel et al.
patent: 6212530 (2001-04-01), Kadlec
patent: 6236988 (2001-05-01), Aldred
patent: 6240407 (2001-05-01), Chang et al.
patent: 6243709 (2001-06-01), Tung
patent: 6269361 (2001-07-01), Davis et al.
patent: 6275977 (2001-08-01), Nagai et al.
patent: 6279007 (2001-08-01), Uppala
patent: 6286028 (2001-09-01), Cohen et al.
patent: 6289500 (2001-09-01), Baxter et al.
patent: 6298354 (2001-10-01), Saulpaugh et al.
patent: 6308176 (2001-10-01), Bagshaw
patent: 6308314 (2001-10-01), Carlson et al.
patent: 6314420 (2001-11-01), Lang et al.
patent: 6331865 (2001-12-01), Sachs et al.
patent: 6339838 (2002-01-01), Weinman, Jr.
patent: 6347333 (2002-02-01), Eisendrath et al.
patent: 6411993 (2002-06-01), Reynolds et al.
patent: 6415316 (2002-07-01), Van Der Meer
patent: 6442577 (2002-08-01), Britton et al.
patent: 6470171 (2002-10-01), Helmick et al.
patent: 6529889 (2003-03-01), Bromberg et al.
patent: 6544294 (2003-04-01), Greenfield et al.
patent: 6592628 (2003-07-01), Prinzing
patent: 6594646 (2003-07-01), Okayama et al.
patent: 20030050916 (2003-03-01), Ortega et al.
patent: 20030140315 (2003-07-01), Blumberg et al.
patent: 63-286931 (1988-11-01), None
patent: WO9932982 (1999-07-01), None
IBM Digital Library “Application Programming Reference”, Version 2, Second Edition (Sep. 1997) pp. 1147-1257.
IBM Digital Library “Guide to Object-Oriented and Internet Application Programming”, Version 2, Second Edition (Sep. 1997), pp. 1-169.
IBM Digital Library “Text Search using TextMiner Application Programming Reference” First Edition, Sep. 1997. pp. 1-246.
BarnesandNoble.com, Entertainment We Recommend, Copyright 1999, pp. 1-2, <http://web.archive.org/web/19991122052147/www.barnesandnoble.com/subjects/entert/entert.asp?pcount=0>.
The New York Times Company, The New York Times on the Web. Copyright 1999, pp. 1-3, <http://web.archive.org/web/19990208010553/http://times.com/>.
Dimick, Classical and Flamenco Guitar MIDIs, Copyright 1998, pp. 1-2, <http://web.archive.org/web/19990117081725/www.guitarist.com/midis/midis.htm>.
KG Sinclair, Free E-books You Can Download, Copyright 1999, pp. 1-5, <http://web.archive.org/web/19991128041349/ksinclair.com/ebooks.htm>.
Jeff Sutherland, Business object design and implementation workshop, ACM SIGPLAN OOPS Messenger. Addendum to the proceedings of the 10thannual conference on Object-oriented programming systems, languages, and applications (Addendum), Oct. 1995, vol. 6, Issue 4.
Haim Kilov et al., Semantic integration in complex systems, ACM SIGPLAN OOPS Messenger, Addendum to the proceedings of the 10thannual conference on Object-oriented programming systems, languages, and applications (Addendum), Oct. 1995, vol. 6, Issue 4.
ezWriter 2.0 for Windows, Aug. 5, 1998 by Lance Vaughn, Atlanta, IN, downloaded from <http://www.winsite.com> on Jun. 22, 2003, application screenshots pp. 1-15.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Hitmask for querying hierarchically related content entities does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Hitmask for querying hierarchically related content entities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hitmask for querying hierarchically related content entities will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3382136

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.