Reducing memory requirements needed to represent XML 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, C711S101000, C711S117000, C711S216000, C711S221000

Reexamination Certificate

active

07321900

ABSTRACT:
Described herein are approaches that allow an XML entity to be accessed in a way that requires less memory. These approaches involve dynamically generating and maintaining an in-memory representation of only a portion of an XML tree. The in-memory representation of an XML tree is herein referred to as a node tree. The node tree contains data from the XML tree, and is generated by extracting data from a compressed form of an XML entity. In addition, the node tree contains information about the location of specific elements within the compressed XML entity. The approaches described herein allow an XML tree to be accessed without having to generate an in-memory representation of the whole XML tree, thus reducing the amount of memory needed to access the data in the XML tree.

REFERENCES:
patent: 6108698 (2000-08-01), Tenev et al.
patent: 6542911 (2003-04-01), Chakraborty et al.
patent: 6584458 (2003-06-01), Millett et al.
patent: 6654761 (2003-11-01), Tenev et al.
patent: 6662342 (2003-12-01), Marcy
patent: 6675230 (2004-01-01), Lewallen
patent: 6721723 (2004-04-01), Gibson et al.
patent: 6801224 (2004-10-01), Lewallen
patent: 6804677 (2004-10-01), Shadmon et al.
patent: 6826568 (2004-11-01), Bernstein et al.
patent: 6826727 (2004-11-01), Mohr et al.
patent: 6836857 (2004-12-01), Ten-Hove et al.
patent: 6915304 (2005-07-01), Krupa
patent: 6915307 (2005-07-01), Mattis et al.
patent: 6964025 (2005-11-01), Angiulo et al.
patent: 7031956 (2006-04-01), Lee et al.
patent: 7134072 (2006-11-01), Lovett et al.
patent: 2002/0029229 (2002-03-01), Jakopac et al.
patent: 2002/0073019 (2002-06-01), Deaton
patent: 2002/0087596 (2002-07-01), Lewontin
patent: 2002/0116371 (2002-08-01), Dodds et al.
patent: 2002/0116457 (2002-08-01), Eshleman et al.
patent: 2002/0143512 (2002-10-01), Shamoto et al.
patent: 2002/0156811 (2002-10-01), Krupa
patent: 2002/0184188 (2002-12-01), Mandyam et al.
patent: 2003/0078906 (2003-04-01), Ten-Hove et al.
patent: 2003/0204787 (2003-10-01), Bartucca et al.
patent: 2004/0148278 (2004-07-01), Milo et al.
patent: 2004/0267760 (2004-12-01), Brundage et al.
patent: 2005/0289125 (2005-12-01), Liu et al.
Lo et al., “XAS: A System for Accessing Componentized, Virtual XML Documents,” IEEE, 2001, pp. 493-502. (References located on enclosed CD-ROM).
Zisman et al., “Using XML to Build Consistency Rules for Distributed Specifications,” Proceedings of the Tenth International Workshop on Software Specification and Design (IWSD'00), IEEE 2000, 8 pages. (References located on enclosed CD-ROM).
Myllymaki, Jussi, “Effective Wed data Extraction with Standard XML Technologies,” WWW10, May 1-5, 2001, pp. 689-696. (References located on enclosed CD-ROM).
Schmidt et al., “Why and How to Benchmark XML Databases,” SIGMOND Record, vol. 3, No. 3, Sep. 2001, pp. 27-32. (References located on enclosed CD-ROM).
“Oracle 9i XML Developer's Kits Guide—XDK” Release 2 (9.2), Mar. 2002, 774 pages (Chapters 13-19 extracted, 88 pages). Online retrieved at <www.oracle.com/pls/db92/db92.docindex>.

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

Reducing memory requirements needed to represent XML 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 Reducing memory requirements needed to represent XML entities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducing memory requirements needed to represent XML entities will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2806833

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