Efficient access to text-based linearized graph data

Details Efficient access to text-based linearized graph data Efficient access to text-based linearized graph data

2002-03-25

2010-10-05

Stork, Kyle R (Department: 2178)

Data processing: presentation processing of document, operator i

Presentation processing of document

Structured document

Reexamination Certificate

active

07810024

ABSTRACT:
Methods and apparatus implementing systems and techniques for accessing text-based linearized graph data. In general, in one aspect, a method includes obtaining text-based linearized graph data representing a data structure having nodes, and generating node-traversal data for the text-based linearized graph data, where the node-traversal data identifies for each of a subset of nodes in the represented data structure one or more locations in the text-based linearized graph data corresponding to one or more other nodes in the represented data structure, and associating the node-traversal data with the text-based linearized graph data. For example, linear offsets can be added to a document including text-based linearized graph data, such as an XML document, to enable random access to the represented nodes without having to parse the entire document, and without interfering with the generally understood structure and content of the document.

REFERENCES:
patent: 5845305 (1998-12-01), Kujiraoka
patent: 6073144 (2000-06-01), van Hoff
patent: 6101512 (2000-08-01), DeRose et al.
patent: 6339780 (2002-01-01), Shell et al.
patent: 6418403 (2002-07-01), Fuji
patent: 6584459 (2003-06-01), Chang et al.
patent: 6631379 (2003-10-01), Cox
patent: 6643653 (2003-11-01), Chu
patent: 6654761 (2003-11-01), Tenev et al.
patent: 7019864 (2006-03-01), Delhoune et al.
patent: 2001/0049675 (2001-12-01), Mandler et al.
patent: 2002/0062311 (2002-05-01), Kircher
patent: 2002/0099745 (2002-07-01), Huck et al.
patent: 2003/0066033 (2003-04-01), Direen et al.
patent: 2003/0101169 (2003-05-01), Bhatt et al.
patent: 2004/0015840 (2004-01-01), Walker
patent: 2004/0205549 (2004-10-01), Yassin et al.
patent: 2004/0205552 (2004-10-01), Vosburgh
patent: WO94/14122 (1994-06-01), None
U.S. Appl. No. 60/318,956, filed Sep. 13, 2001.
Clark, “DOM and SAX are Dead, Long Live DOM and SAX,” Nov. 14, 2001, <http://www.xml.com/Ipt/a/2001/11/14/dom-sax.html>, pp. 1-7.
Hors, et al. “Document Object Model Core,” Nov. 13, 2000, <http://www.w3.org/TR/DOM-Level-2-Core/core.html>, pp. 1-71.
“Unicode in XML and other Markup Languages: Unicode Technical Report #20,” Feb. 18, 2002, <http://www.w3.org/TR/2002/NOTE-unicode-xml-20020218/>, pp. 1-33.
“Two-part Addresses and Memory Segmentation,” Aug. 7, 2001, <http://web.archive.org/web/20010807224345/http://homepage.smc.edu/morgan—david/cs40/segmentation.htm>, pp. 1-5.
“Document Object Model (DOM) Level 3 Abstract Schemas and Load and Save Specifications,” www.w3.org/TR/DOM-Level-3-ASLS Version 1, W3C Working Draft, Jan. 14, 2002.
“Document Object Model Load and Save,” Oct. 25, 2001, www.w3.org/TR/2001/WD-DOM-Level-3-ASLS-20011025/load-save.html.
“Scripts” (in HTML documents), www.w3.org/TR/htm14/interact/scripts.html, Feb. 28, 2002.
“HOWTO: Retrieve XML Data Asynchronously with ondataavailable Event (Q285874),” http://support.microsoft.com/default.aspx?scid=kb;EN-US;q285874, Feb. 28, 2002.
“Microsfot XML Core Services (MSXML) 4.0—DOM Reference, readyState Property (DOMDocuments),” http://msdn.microsoft.com/library/en-us/xmlsdk/htm/xml—pro—pr—2rlw.asp?frame=true, Dec. 20, 2001.
Microsfot XML Core Services (MSXML) 4.0—DOM Reference, getAttribute Method, http://msdn.microsoft.com/library/en-us/xmlsdk/htm/xml—mth—dg—5rfo.asp?frame=true, Dec. 20, 2001.
Microsfot XML Core Services (MSXML) 4.0—DOM Developer's Guide, Getting and Setting Parse Flags, http://msdn.microsoft.com/library/en-us/xmlsdk/htm/dom—howdoi—58ab.asp?frame=true, Dec. 20, 2001.
Augusti, “Parsing and DOM-Tree Building with JavaScript”, Apr. 13, 2001, <http://www.oreillynet.com/lpt/a/766>, pp. 1-5.
Brownell, “Top Ten SAX2 Tips”, Dec. 5, 2001, <http://www.xml.com/lpt/a/2001/12/05/sax2.html>, pp. 1-13.
Chappell, et al. “Benchmarking JMS-Based E-Business Messaging Providers”, Mar. 1, 2001, <http://www.syscon.com/story/?storyid=36219&DE=1>, pp. 1-13.
Dodds, “Storing and Querying”, Apr. 5, 2000, <http://www.xml.com/Ipt/a/2000/04/05/deviant/index.html>, pp. 1-4.
Dumbill, “Quilt Has Querying Covered”, Jun. 13, 2002, <http://www.xml.com/lpt/a/2000/06/xmleurope/quilt.html>, pp. 1-3.
Euzenat, et al. “XML Transformation Flow Processing”, 2001, <http://www.transmorpher.inrialpes.fr/wpaper/>, pp. 1-20.
Hampton, “High Performance XML Parsing with SAX”, Feb. 14, 2001, <http://www.xml.com/lpt/a/2001/02/14/perlsax.html>, pp. 1-6.
Idris, “Should I Use SAX or DOM?”, May 22, 1999, <http://developerlife.com/saxvsdom/default.html>, pp. 1-5.
“Perl XML Quickstart: The Standard XML Interfaces”, May 16, 2001, <http://www.xml.com/Ipt/a/2001/05/16/perlxml.html>, pp. 1-6.
Rodriguez, “Processing XML with Perl.”, Apr. 5, 2000, <http://www.xml.com/Ipt/a/2000/04/05/feature/index.html>, pp. 1-9.
“Sax-Like Event Handlers for the Generic Parsing of ASN.1 Encoded Data”, Feb. 2001, Objective Systems, Inc., pp. 1-9.
Sedgewick, “Algorithms in C”, 1998, Addison-Wesley, 3rdEdition, pp. 105-108.
“The Collected Works of SAX”, Jul. 18, 2001, <http://www.xml.com/Ipt/a/2001/07/18/collectedsax.html>, pp. 1-4.
Walsh, “Getting Started with XML Programming, Part II”, May 5, 1999, <http://www.xml.com/Ipt/a
orm/part2/getstart2.html>, pp. 1-8.
“Writing SAX Drivers for Non-XML Data”, Sep. 19, 2001, <http://www.xml.com/Ipt/a/2001/09/19/sax-non-xml-data.html>, pp. 1-9.

Affiliated with

Also associated with

Rating

Efficient access to text-based linearized graph data 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 access to text-based linearized graph data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient access to text-based linearized graph data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4204000