text:
she's incredible! she's so hot! the perfect example of a woman with very small breast but anyway wonderful. So women, don't care dear! if you're at least 1/4 of her, you're good the same :)
Thanks for helping us associate the correct Pornstars to this video!
Pornstar Name:
Todos los comentarios (28)
she's incredible! she's so hot! the perfect example of a woman with very small breast but anyway wonderful. So women, don't care dear! if you're at least 1/4 of her, you're good the same :)
wish i was there and let you due me .
one of the most georgeous girls I have ever seen and best handjob on this site nice tits & hair, awesome
That was a weak cumshot! Really a girl that gorgeous you should cover her in cum
My bf and I love to watch porn together. Im always looking for new ways to play with his cock. Im going to show this one to him and then DO IT for him. This even made me horny. Too bad the guy was a dribbler. I know if I do this for my bf he will shoot his cum all over me. I cant wait for him to get home tonight.
all that wonderful hand action , for a few driplets of cum, what a fucking waste
Fa godere solo a guardaroba.Corpo perfetto!
This is from one of the great Handjob Hunnies dvds. Btw I used to work with a girl who looks like this, v teasing
sperm belongs down her throat
Beautiful face and nice breasts.
what is with the alignment of his dick and what she was wearing?
She's name i Katy
What is Her name, she is very Beautiful and very Sexy and has a lovely smile and knows how to masturbate Penis's Which she likes doing very expertly Starts off Slowly gradually going quicker With her hands and fingers knows how to give pleasure to the male while masturbating his penis and she likes doing IT. Very Good
What's the name of this girl?!
I think I'm in love. She's lovely.
she is hot!! this is one of my favorites, does anyone know if she has other vids?
Desert Rose
Fatal Error it was a almost perfect , she looks directy in your eyes a great beginnig great middel and then the cumshot......aaahhh way to short i was waitn for huge lode all over her tits and body but still love it
love her...slow and sensual...both hands...varied technique. loved it.
every red blooded man's dream
I enjoyed that, pity about the lousy cum shot though.
Nice girl, a shame her nipples don't get hard... and would have loved to see her sucking real deep.
why does she need to get completely head to toe naked to give a handjob? that just seems unnecessary...


text:
Includes 1.59 Index Single Vision Lenses
Stuff by Hilary Duff 121077 004 Silver eyeglasses give you an added sparkle for your day! These semi-rimless glasses come in a stainless steel front. The clear acetate arms have a silver lace detail. Nose pads and spring hinges ensure a comfortable fit!About the Brand
If you're looking for something to jumpstart your eyeglasses wardrobe, take a look at what "Stuff by Hilary Duff" has to offer! Cute styles in fun shapes, perfect for any outing!

subset: commoncrawl


text:
+ Post New Thread
Hi all,
I just wanted to let you know about a new free email course - Best Practices for Improving your Sencha Apps - that I have just released.
Ok, I'm Italian, but I don't want my interface in spanish!! I looked for the profile option and I set "English" as interface!!!
Today's mailout mentions that Ext.JS and Touch are merging.
Is it Sencha's plan to charge a per end-user fee to apps packaged using cordova...
I seem to have turned off all email notifications about replies to threads on the Sencha forum I've subscribed to and I can't identify how to reverse...
Am not aware how sencha collects its feedback from customers to create its roadmap. I am sure they do it time to time, but for those of us who dont...
I'm having a problem using the sencha complete plugin. When I create a project I'm getting the following error:
'Building workspace' has...
Have real hassles with logging into the forum.
Got this today.
Having trouble downloading the Free Commercial version
I tried filling out the form at least 20 times....never get an email, message or...
So, instead of tweeting (with the 100s of other fanboys), I figured I would post a note or two (maybe 3) of my experiences at the conferences.
Hi everyone,
I started to port all extjs 4 examples from sencha to mvc.
You can check them out on my blogs: http://loiane.com (portugese) and...
Get an error trying to comment on blog posts.
Any idea why?
It's time for a new Meetup about Sencha & HTML5 in Malmö Sweden. We'll talk a lot about the new cool stuff announced at SenchaCon. Register on one of...
What can we expect from the Sponsor Welcome Reception that runs from 6-9 tonight? Is there dinner and drinks or is this just a time to register and...
ExtJS needs a public read/write bugtracker. I know this has been raised several times before. Here are some reasons for not having a bugtracker I've...
I am going to SenchaConn (my 1st, so I am a senchaconn virgin), in the fairly short email telling me to download the senchaconn app that will tell me...
:D Hello :D
I've had "c is not a constructor" for a while. So, I've changed ext-debug.js so I could get more info about what is going on:
With ExtJS 3.x support coming to an end (1 June 2015), which version of the framework do you still use most on daily basis?
It's 3.x for us.
Is it legal if 5 freelance programmers join together and buy 5 packed license ?


text:
Want to play sports? Now you can register online.
Foss Offers the International Baccalaureate Program
Join us for the 2016 Daffodil Princess Selection
How are you going to pay for college? Check out this webinar.
Register for your May 2016 IB Exams!
Foss is a school of grace, compassion, scholarship, and service. Our International Baccalaureate (IB) Program prepares students for college, and with IB, students are more likely to get into and through their college and/or career of choice. Our school is committed to serving students and families in proactive, meaningful ways so that students can earn their education and be proud of their accomplishments. For the Foss Family, nothing is more important than good health and good education. We promote and grow both here at Foss High School.
Foss IB World School2112 South Tyler StreetTacoma, WA 98405
District Benchmarks
Bell Schedules
Foss Handbook
Peachjar - find school flyers online
10/7 IB Exam Registration
10/14 Application/Essay Assistance Workshop
Apply for a Next Move internship
Online Registration for Sports
Foss Innovation
Tacoma Public Schools
© 2013 Tacoma Public Schools. All rights reserved.


text:
United to resume 787 flying on May 20
The 787s had been grounded because of concerns about smoldering batteries, but they have been returning to the skies. Ethiopian Airlines was the first to fly a 787 again, on April 27.
The first United flight will be from Houston to Chicago. A spokeswoman for United Continental Holdings Inc. says the first flights will be around the U.S.
Boeing is putting a new battery system on 50 of the 787s that have been delivered around the world. United's planes are being worked on at a Boeing facility in San Antonio, Texas.
Swedish Edmonds nearly ready to unveil $63.5 million ER, expansion Americans spending, not saving, cheap gas windfall Trade groups forecast strong holiday sales season Bernanke memoir renews debate over Wall Street Netflix raising U.S. price for most popular video plan Briefs: Career fair planned at EdCC
Share your comments: Log in using your HeraldNet account or your Facebook, Twitter or Disqus profile. Comments that violate the rules are subject to removal. Please see our terms of use. Please note that you must verify your email address for your comments to appear.
You are logged in using your HeraldNet ID. Click here to update your profile. | Log out.
Our new comment system is not supported in IE 7. Please upgrade your browser here.


text:
Sergio Salvador salvadorphoto.com
Restaurant Review
La Isla
Mexican food for marineros and landlubbers alike
By Ari LeVaux
The feeling inside La Isla, on Bridge just west of the river, is laid-back and celebratory. Western fantasy, Dances With Wolves-style paintings of animals and the men who wrangle them hang on the walls, along with Old West photos and framed news clippings. There are plants (real and fake), suspended paper bells that look leftover from Chinese New Year, and some painted globe chandeliers that might have come from a midcentury diner. An exterior roof façade crowns the kitchen, making it seem like you're outside while the kitchen is in a little cabana on the beach.
By Evan George and Alex Brown
We just purchased a half a pound—each—of fresh chanterelles (it is fall, people!). But in a bout of lunch-box paranoia, Evan feared that the mushrooms would shrivel in the fridge and miss their peak. So we minced the beauties and made a mushroom duxelles (say "duke-sell")—a classic French dish of mushrooms roasted with shallots, fat and wine. Nearly a tapenade, the stuff is versatile enough to work on vegan bruschetta or dress up leftovers.
EVENT HORIZON (Saturday, Oct 10)
Peruse the Brews
6th Annual New Mexico Brew Fest
By Desiree Garcia
Celebrate New Mexico's thriving craft beer industry.
Today's Events
6th Annual New Mexico Brew Fest at Expo New Mexico
Celebrate New Mexico's thriving craft beer industry.
Bokashi Bucket Composting at Holiday Park Community Center
Cinnamon Cafe Cooking Classes at Cinnamon Sugar & Spice CafeMore Recommended Events ››
Boxtoberfest 2015 • 10.24.2015
home | feature | news | film | music | art | food | classifieds | personals | staff | lo-fi | search
© 1996-2015 Weekly Alibi email@example.com
View mobile version


text:
|Publication number
|Publication type
|Application number
|Publication date
|Jul 8, 2008
|Filing date
|Sep 16, 2004
|Priority date
|Apr 9, 2004
|Fee status
|Also published as
|Publication number
|Ashish Thusoo, Ravi Murthy, Sivasankaran Chandrasekar, Nipun Agarwal, Eric Sedlar
|Original Assignee
|Oracle International Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (104), Non-Patent Citations (47), Referenced by (17), Classifications (22), Legal Events (3)
|External Links: USPTO, USPTO Assignment, Espacenet
This application claims priority to U.S. Provisional Patent Application Ser. No. 60/560,927, entitled XML INDEX FOR XML DATA STORED IN VARIOUS STORAGE FORMATS, filed on Apr. 9, 2004, the contents of which are herein incorporated by reference in their entirety for all purposes.
This application claims priority to U.S. Provisional Patent Application No. 60/580,445 entitled XML INDEX FOR XML DATA STORED IN VARIOUS STORAGE FORMATS, filed on Jun. 16, 2004, the contents of which are herein incorporated by reference in their entirety for all purposes.
This application claims priority to U.S. Provisional Patent Application Ser. No. 60/582,706, entitled TECHNIQUES FOR PROCESSING XQUERY QUERIES IN A RELATIONAL DATABASE MANAGEMENT SYSTEM, filed on Jun. 23, 2004, the contents of which are herein incorporated by reference in their entirety for all purposes.
This application is related to U.S. patent application Ser. No. 10/884,311, entitled INDEX FOR ACCESSING XML DATA, filed on Jul. 2, 2004, the contents of which are herein incorporated by reference in their entirety for all purposes.
This application is related to U.S. patent application Ser. No. 10/944,171, entitled MECHANISM FOR EFFICIENTLY EVALUATING OPERATOR TREES, filed on Sep. 16, 2004, the contents of which are herein incorporated by reference in their entirety for all purposes.
This application is related to U.S. patent application Ser. No. 10/944,177, entitled INDEX MAINTENANCE FOR OPERATIONS INVOLVING INDEXED XML DATA, filed on Sep. 16, 2004, the contents of which are herein incorporated by reference in their entirety for all purposes.
This application is related to U.S. Provisional Patent Application Ser. No. 60/599,319, entitled EFFICIENT EVALUATION OF QUERIES USING TRANSLATION, filed on Aug. 6, 2004, the contents of which are herein incorporated by reference in their entirety for all purposes.
This application is related to U.S. Provisional Patent Application Ser. No. 60/599,652, entitled PROCESSING QUERIES AGAINST ONE OR MORE MARKUP LANGUAGE SOURCES, filed on Aug. 5, 2004, the contents of which are herein incorporated by reference in their entirety for all purposes.
The present invention relates to accessing an XML index and, more specifically, to translating expressions and constructs into SQL for accessing an XML index.
There are many database systems that allow storage and querying of eXtensible Markup Language data ("XML data"). Though there are many evolving standards for querying XML, all of them include some variation of XPath. XPath allows XML data to be queried based on path expressions. A path expression is any expression that specifies a path through the hierarchical structure of an XML document. The portion of an XML document identified by a path expression is the portion that resides, within the structure of the XML document, at the end of any path that matches the path expression.
A query that uses a path expression to identify one or more specific pieces XML data is referred to herein as a path-based query. The process of determining which XML data corresponds to the path designated in a path-based query is referred to as "evaluating" the path expression.
Unfortunately, even database systems that have built-in support for storing XML data are usually not optimized to handle path-based queries, and the query performance of the database systems leaves much to be desired. In specific cases where an XML schema definition may be available, the structure and data types used in XML instance documents may be known. However, in cases where an XML schema definition is not available, and the documents to be searched do not conform to any schema, there are no efficient techniques for querying using path-based queries.
Without XML indexes, path expressions were directly evaluated against the base tables. As a result, the processing of these expressions involved a complete scan of the base tables. Each scanned row was tested to ascertain whether it satisfied the path expression. Moreover, the evaluation of the path expression was typically done in a functional way manner by constructing a DOM (memory data structure) and traversing the DOM tree while evaluating the path.
Based on the foregoing, there is a clear need to improve the processing time of path-based queries by providing a way for path-based queries to retrieve data from XML documents without incurring the problems associated with a complete scan of the base tables and construction of expensive memory data structures.
The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.
The present invention is illustrated by way of example, and not by way of limitation, in the figure of the accompanying drawing and in which like reference numerals refer to similar elements and in which:
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
U.S. patent application Ser. No. 10/884,311, entitled INDEX FOR ACCESSING XML DATA, filed on Jul. 2, 2004, describes various embodiments of an index that may be used to efficiently access XML documents, managed by a relational database server, based on path-based queries. Indexes for accessing XML data, such as the indexes disclosed in '311, shall be referred to herein as XML indexes.
An XML index provides a mechanism for indexing paths, values, and order information in XML documents. The actual XML data itself can reside in any form, like CLOB (character large object storing the actual XML text), O-R (object relational structured form in the presence of an XML schema), or BLOB (binary large object storing some binary form of the XML data). In one embodiment, an XML index consists of three logical structures that include a path index, an order index, and a value index, and can reside in a single table, hereinafter path_table.
For the purpose of explanation, the techniques described herein are described in a context in which an XML index, as described in U.S. patent application Ser. No. 10/884,311, is used to index the XML documents. However, the techniques are not limited to any specific index structure or mechanism.
For the purpose of explanation, examples shall be given hereafter with reference to the following two XML documents:
. . . .
. . . .
As indicated above, po1.xml and po2.xml are merely two examples of XML documents. The techniques described herein are not limited to XML documents having any particular types, structure or content. Examples shall be given hereafter of how such documents would be indexed and accessed according to various embodiments of the invention.
According to one embodiment, an XML index is a domain index that improves the performance of queries that include Xpath-based predicates and/or Xpath-based fragment extraction. An XML index can be built, for example, over both XML Schema-based as well as schema-less XML Type columns which are stored either as CLOB or structured storage. In one embodiment, an XML index is a logical index that results from the cooperative use of a path index, a value index, and an order index.
The path index provides the mechanism to lookup fragments based on simple (navigational) path expressions. The value index provides the lookup based on value equality or range. There could be multiple secondary value indexes—one per datatype. The order index associates hierarchical ordering information with indexed nodes. The order index is used to determine parent-child, ancestor-descendant and sibling relationships between XML nodes.
When the user submits a query involving XPaths (as predicate or fragment identifier), the user XPath is decomposed into a SQL query that accesses the XML index table. The generated query typically performs a set of path, value and order-constrained lookups and merges their results appropriately.
According to one embodiment, a logical XML index includes a PATH table, and a set of secondary indexes. As mentioned above, each indexed XML document may include many indexed nodes. The PATH table contains one row per indexed node. For each indexed node, the PATH table row for the node contains various pieces of information associated with the node.
According to one embodiment, the information contained in the PATH table includes (1) a PATHID that indicates the path to the node, (2) "location data" for locating the fragment data for the node within the base structures, and (3) "hierarchy data" that indicates the position of the node within the structural hierarchy of the XML document that contains the node. Optionally, the PATH table may also contain value information for those nodes that are associated with values. Each of these types of information shall be described in greater detail below.
The structure of an XML document establishes parent-child relationships between the nodes within the XML document. The "path" for a node in an XML document reflects the series of parent-child links, starting from a "root" node, to arrive at the particular node. For example, the path to the "User" node in po2.xml is /PurchaseOrder/Actions/Action/User, since the "User" node is a child of the "Action" node, the "Action" node is a child of the "Actions" node, and the "Actions" node is a child of the "PurchaseOrder" node.
The set of XML documents that an XML index indexes is referred to herein as the "indexed XML documents". According to one embodiment, an XML index may be built on all of the paths within all of the indexed XML documents, or a subset of the paths within the indexed XML documents. Techniques for specifying which paths are indexed are described hereafter. The set of paths that are indexed by a particular XML index are referred to herein as the "indexed XML paths".
According to one embodiment, each of the indexed XML paths is assigned a unique path ID. For example, the paths that exist in po1.xml and po2.xml may be assigned path IDs as illustrated in the following table:
Various techniques may be used to identify paths and assign path IDs to paths. For example, a user may explicitly enumerate paths, and specify corresponding path IDs for the paths thus identified. Alternatively, the database server may parse each XML document as the document is added to the set of indexed XML documents. During the parsing operation, the database server identifies any paths that have not already been assigned a path ID, and automatically assigns new path IDs to those paths. The pathid-to-path mapping may be stored within the database in a variety of ways. According to one embodiment, the pathid-to-path mapping is stored as metadata separate from the XML indexes themselves.
According to one embodiment, the same access structures are used for XML documents that conform to different schemas. Because the indexed XML documents may conform to different schemas, each XML document will typically only contain a subset of the paths to which pathids have been assigned.
The location data associated with a node indicates where the XML document that contains the node resides within the base structures. Thus, the nature of the location data will vary from implementation to implementation based on the nature of the base structures. Depending on how the actual XML document is stored, the location data may also include a locator or logical pointer to point into the XML document. The logical pointer may be used for extracting fragments that are associated with nodes identified by XPaths.
For the purpose of explanation, it shall be assumed that (1) the base structures are tables within a relational database, and (2) each indexed XML document is stored in a corresponding row of a base table. In such a context, the location data for a node may include, for example, (1) the rowid of row, within the base table, in which the XML document containing the node is stored, and (2) a locator that provides fast access within the XML document, to the fragment data, that corresponds to the node.
The PATH table row for a node also includes information that indicates where the node resides within the hierarchical structure of the XML document containing the node. Such hierarchical information is referred to herein as the "OrderKey" of the node.
According to one embodiment, the hierarchical order information is represented using a Dewey-type value. Specifically, in one embodiment, the OrderKey of a node is created by appending a value to the OrderKey of the node's immediate parent, where the appended value indicates the position, among the children of the parent node, of that particular child node.
For example, assume that a particular node D is the child of a node C, which itself is a child of a node B that is a child of a node A. Assume further that node D has the OrderKey 22.214.171.124. The final "3" in the OrderKey indicates that the node D is the third child of its parent node C. Similarly, the 4 indicates that node C is the fourth child of node B. The 2 indicates that Node B is the second child of node A. The leading 1 indicates that node A is the root node (i.e. has no parent).
As mentioned above, the Orderkey of a child may be easily created by appending to the OrderKey of the parent a value that corresponds to the number of the child. Similarly, the OrderKey of the parent is easily derived from the OrderKey of the child by removing the last number in the Orderkey of the child.
According to one embodiment, the composite numbers represented by each OrderKey are converted into byte-comparable values, so that a mathematical comparison between two OrderKeys indicates the relative position, within the structural hierarchy of an XML document, of the nodes to which the OrderKeys correspond.
For example, the node associated with the OrderKey 18.104.22.168 precedes the node associated with the OrderKey 1.3.1 in the hierarchical structure of an XML document. Thus, the database server uses a conversion mechanism that converts OrderKey 220.127.116.11 to a first value, and to convert OrderKey 1.3.1 to a second value, where the first value is less than the second value. By comparing the second value to the first value, the database server can easily determine that the node associated with the first value precedes the node associated with the second value. Various conversion techniques may be used to achieve this result, and the invention is not limited to any particular conversion technique.
Some nodes within an indexed document may be attribute nodes or nodes that correspond to simple elements. According to one embodiment, for attribute nodes and simple elements, the PATH table row also stores the actual value of the attributes and elements. Such values may be stored, for example, in a "value column" of the PATH table. The secondary "value indexes", which shall be described in greater detail hereafter, are built on the value column.
According to one embodiment, the PATH table includes columns defined as specified in the following table:
Column Name
ID for the path token. Each distinct path
e.g. /a/b/c is assigned a unique id by the
Rowid of the row in base table.
Dewey order key for the node
e.g. 3.21.5 to indicate 5th child of 21st
child of 3rd child of root.
Information corresponding to the starting
position for the fragment. This is used
during fragment extraction.
Value of the node in case of attributes and
simple elements.
The type can be specified by the user (as
well as the size of the RAW column)
As explained above, the PATHID is a number assigned to the node, and uniquely represents a fully expanded path to the node. The ORDER_KEY is a system representation of the DEWEY ordering number associated with the node. According to one embodiment, the internal representation of the order key also preserves document ordering.
The VALUE column stores the effective text value for simple element (i.e. no element children) nodes and attribute nodes. According to one embodiment, adjacent text nodes are coalesced by concatenation. As shall be described in greater detail hereafter, a mechanism is provided to allow a user to customize the effective text value that gets stored in VALUE column by specifying options during index creation e.g. behavior of mixed text, whitespace, case-sensitive, etc can be customized. The user can store the VALUE column in any number of formats, including a bounded RAW column or a BLOB. If the user chooses bounded storage, then any overflow during index creation is flagged as an error.
The following table is an example of a PATH table that (1) has the columns described above, and (2) is populated with entries for po1.xml and po2.xml. Specifically, each row of the PATH table corresponds to an indexed node of either po1.xml or po2.xml. In this example, it is assumed that po1.xml and po2.xml are respectively stored at rows R1 and R2 of a base table.
In this example, the rowid column stores a unique identifier for each row of the PATH table. Depending on the database system in which the PATH table is created, the rowid column may be an implicit column. For example, the disk location of a row may be used as the unique identifier for the row. As shall be described in greater detail hereafter, the secondary Order and Value indexes use the rowid values of the PATH table to locate rows within the PATH table.
In the embodiment illustrated above, the PATHID, ORDERKEY and VALUE of a node are all contained in a single table. In alternative embodiment, separate tables may be used to map the PATHID, ORDERKEY and VALUE information to corresponding location data (e.g. the base table Rid and Locator).
The PATH table includes the information required to locate the XML documents, or XML fragments, that satisfy a wide range of queries. However, without secondary access structures, using the PATH table to satisfy such queries will often require full scans of the PATH table. Therefore, according to one embodiment, a variety of secondary indexes are created by the database server to accelerate the queries that (1) perform path lookups and/or (2) identify order-based relationships. According to one embodiment, the following secondary indexes are created on the PATH table.
The PATHID_INDEX is built on the pathid, rid columns of the PATH table. Thus, entries in the PATHID_INDEX are in the form (keyvalue, rowid), where keyvalue is a composite value representing a particular pathid/rid combination, and rowid identifies a particular row of the PATH table.
When (1) the pathid of a node and (2) the base table row are known, the PATHID_INDEX may be used to quickly locate the row, within the PATH table, for the node. For example, based on the key value "3.R1", the PATHID_INDEX may be traversed to find the entry that is associated with the key value "3.R1". Assuming that the PATH table is populated as illustrated above, the index entry would have a rowid value of 3. The rowid value of 3 points to the third row of the PATH table, which is the row for the node associated with the pathid 3 and the rid R1.
The ORDERKEY_INDEX is built on the rid and orderkey columns of the PATH table. Thus, entries in the ORDERKEY_INDEX are in the form (keyvalue, rowid), where keyvalue is a composite value representing a particular rid/orderkey combination, and rowid identifies a particular row of the PATH table.
When (1) the base table row and (2) the orderkey of a node are known, the ORDERKEY_INDEX may be used to quickly locate the row, within the PATH table, for the node. For example, based on the key value "R1.′1.2′", the ORDERKEY_INDEX may be traversed to find the entry that is associated with the key value "R1.′1.2′". Assuming that the PATH table is populated as illustrated above, the index entry would have a rowid value of 3. The rowid value of 3 points to the third row of the PATH table, which is the row for the node associated with the orderkey 1.2 and the rid R1.
Just as queries based on path lookups can be accelerated using the PATHID_INDEX, queries based on value lookups can be accelerated by indexes built on the value column of the PATH table. However, the value column of the PATH table can hold values for a variety of data types. Therefore, according to one embodiment, a separate value index is built for each data type stored in the value column. Thus, in an implementation in which the value column holds strings, numbers and timestamps, the following value (secondary) indexes are also created:
These value indexes are used to perform datatype based comparisons (equality and range). For example, the NUMBER value index is used to handle number-based comparisons within user Xpaths. Entries in the NUMBER_INDEX may, for example, be in the form (number, rowid), where the rowid points to a row, within the PATH table, for a node associated with the value of "number". Similarly, entries within the STRING_INDEX may have the form (string, rowid), and entries within the TIMESTAMP_INDEX may have the form (timestamp, rowid).
The format of the values in the PATH table may not correspond to the native format of the data type. Therefore, when using the value indexes, the database server may call conversion functions to convert the value bytes from stored format to the specified datatype. In addition, the database server applies any necessary transformations, as shall be described hereafter. According to one embodiment, the conversion functions operate on both RAW and BLOB values and return NULL if the conversion is not possible.
By default, the value indexes are created when the XML index is created. However, users can suppress the creation of one or more of value indexes based on the knowledge of query workload. For example, if all XPath predicates involve string comparisons only, the NUMBER and TIMESTAMP value indexes can be avoided.
According to one embodiment, the set of secondary indexes built on the PATH table include a PARENT_ORDERKEY_INDEX. Similar to the ORDER_KEY index, the PARENT_ORDERKEY_INDEX is built on the rid and order_key columns of the PATH table. Consequently, the index entries of the PARENT_ORDERKEY_INDEX have the form (keyvalue, rowid), where keyvalue is a composite value that corresponds to a particular rid/order_key combination. However, unlike the ORDER_KEY index, the rowid in a PARENT_ORDERKEY_INDEX entry does not point to the PATH table row that has the particular rid/order_key combination. Rather, the rowid of each PARENT_ORDERKEY_INDEX entry points to the PATH table row of the node that is the immediate parent of the node associated with the rid/order_key combination.
For example, in the populated PATH table illustrated above, the rid/order_key combination "R1.′1.2′" corresponds to the node in row 3 of the PATH table. The immediate parent of the node in row 3 of the PATH table is the node represented by row 1 of the PATH table. Consequently, the PARENT_ORDERKEY_INDEX entry associated with the "R1.′1.2′" key value would have a rowid that points to row 1 of the PATH table.
As described above, an XML index indexes nodes, within XML documents, based on the paths to the nodes. The following are examples of path expressions that a path-based query may include:
The path components contained in the XML index may be used to efficiently evaluate path expressions. Typically, evaluating path expressions from the indexed path components is much faster than evaluating path expressions against the base tables, which would result in a complete scan of the original XML documents.
As shall be described in more detail hereafter, techniques are provided for rewriting path expressions, such as those contained within path-based queries, to access the XML index. According to one embodiment, the techniques involve identifying a path specified in the input query, identifying a template that corresponds to the format of the specified path, and generating, based on rules associated with the template, an "index-enabled" query that uses the XML index to locate the XML data that corresponds to the specified path. The index-enabled query may be, for example, a SQLX query (a SQL query that may include XML-specific operators).
More specifically, the techniques may involve (1) decomposing a generic path expression into simpler components such as simple paths, predicates, and structural joins; (2) generating a SQL query against tables of the XML index, which may involve expressing the structural joins using SQL predicates on Dewey order keys of the indexed paths components; and (3) fragment extraction using locators that point to the original data in an efficient way. Using fragment extraction, the database server uses the XML index to return the locators, and the actual XML data at the locators, that need to be read and supplied to the user.
The following templates define how, in one embodiment, index-enabled queries are generated based on path expressions, where the index-enabled queries access the path_table of the XML index. As mentioned above, the path expression of a path-based query, or fragments thereof, are matched against templates. Each template is associated with a rule. When a fragment of a specified path is in a format that matches a template, the corresponding rule is then used to generate SQL for an index-enabled query.
Templates, and the corresponding rules, of one embodiment are described in detail hereafter. The templates given as examples hereafter include templates that correspond to simple path expressions, filter expressions, descendant axis expressions, wildcard expressions, logical expressions, relational expressions, literals, casting nodesets to Boolean expressions, and text functions. The translation of path expressions into SQL for accessing the path_table of the XML index is not limited to the specific examples given hereafter. The templates are simply examples of how, in one embodiment, such translation may be performed.
Simple paths are expressions of the type "/a/b/c" which have no other axes apart from child axes and which do not have any filters on the axis paths. Simple paths, such as "/a/b/c," are rewritten, according to one embodiment, to the following SQL:
/a/b/c → select pt1.pathid, pt1.rid, pt1.order_key, pt1.locator, pt1.value from path_table pt1 where pt1.pathid = :B1
where:B1=pathid('/a/b/c'), and where the function pathid( ) denotes an internal function used to lookup the pathid associated with the concerned path.
Filter expressions are expressions of the type "P1[F(P2)]" where P1 is a path expression and F is a filter defined on the relative path P2. An example of a filter expression using the XML documents described above is /PurchaseOrder/Actions/Action[User="King"]. In this example, P1 would correspond to "/PurchaseOrder/Actions/Action" and P2 would correspond to "User." Filter expressions, such as "P1 [F(P2)]", are rewritten, according to one embodiment, to the following SQL:
select pt1.pathid, pt1.rid, pt1.order_key, pt1.locator, pt1.value
from (sql1) pt1
where exists (select pt2.pathid, pt2.rid, pt2.order_key, pt2.locator,
from (sql2) pt2
where pt2.order_key > pt1.order_key and
pt2.order_key < maxkey(pt1.order_key) and
pt1.rid = pt2.rid)
where sql1 and sql2 represent the SQL generated for evaluating P1 and P1/P2, respectively. Maxkey( ) is an internal function that takes an order key of a node as input and generates a key that is greater than the key of any descendant of the input order key.
An example of a filter expression that conforms to this template is /Po[id="1"]. In this example, /Po corresponds to P1 of the template, "id" corresponds to P2 of the template, and "=1" corresponds to F of the template. Thus, in this example:
In this example, both P1 (i.e./Po) and P1/P2 (i.e./Po/id) are simple path expressions. Therefore, the rule for simple path expressions, described above, would be used to determine the SQL for sql1 and sql2.
For the purpose of explanation, the rows produced by sql1 shall be referred to herein as the sql1 rows. Similarly, the rows produced by sql2 shall be referred to herein as the sql2 rows. The sql generated by the rule of this template, therefore, selects from the sql1 rows only those rows that have an order key corresponding to nodes that are ancestors (parents) of nodes returned by sql2.
Descendant axis expressions are expressions of the type "P1//P2" where P1 and P2 are path expressions. A simple example of a descendant axis expression is /PurchaseOrder//User, which selects all the User elements that are descendants (whether a child element, grandchild element, etc.) of the PurchaseOrder element. Descendant axis expressions are rewritten, according to one embodiment, using the SQL shown below:
P1//P2 → select pt2.pathid, pt2.rid, pt2.order_key, pt2.locator, pt2.value from path_table pt2 where pt2.pathid in (select * from sys_xdbpathsuffix(:B1)) and exists(select pt1.* from (sql) pt1 where pt2.order_key > pt1.order_key and pt2.order_key < maxkey(pt1.order_key) and pt1.rid = pt2.rid)
where:B1=pathid(P2) in which P2 is a simple path, where sql corresponds to the rewritten SQL for expression P1, and where sys_xdbpathsuffix( ) is a table function that generates path ids corresponding to all nodes whose paths have P2 as a suffix, i.e. all //P2 paths.
Wildcard expressions are expressions of the type "P1/*/P2." A simple example of this expression is "/PurchaseOrder/*/Action" which selects all the Action elements that are grandchild elements (and only grandchild elements) of the PurchaseOrder element. Also, it is possible to include multiple wildcards (*) in the expression such as "P1/*/*/*/P2" which indicates that the first element of path P2 is the great-great grandchild of the last element of P1. Wildcard expressions are rewritten, according to one embodiment, using the SQL shown below:
P1/*/P2 → select pt2.pathid, pt2.rid, pt2.order_key, pt2.locator, pt2.values from path_table pt2, (sql) pt1 where pt2.pathid in (select * from sys_xdbpathsuffix(:B1)) and exists(select pt1.* from (sql) pt1 where pt2.order_key > pt1.order_key and pt2.order_key < maxkey(pt1.order_key) and depth(pt2.order_key) = depth(pt1.order_key)+1 and pt1.rid = pt2.rid)
where:B1 equals pathid(//P2) in which P2 is a simple expression, where sql corresponds to the rewritten SQL for the expression P1, and where the function depth( ) is an internal function that, given an order key of a node, can compute the depth of the node.
Logical expressions are expressions of the type "E1 op E2" where E1 and E2 are expressions and op is either a logical AND or a logical OR. Logical expressions, such as "E1 op E2," are rewritten, according to one embodiment, using the following rule:
Since E1 and E2 are being combined by a Boolean operator, E1 and E2 should be expressions that produce Boolean values. In the present example, the value 1 is used to represent true, and the value 0 is used to represent false. Thus, the statement "sql1>0" is true if the expression E1 evaluates to 1, and if false if E1 evaluates to 0. Similarly, the statement "sql2>0" is false if the expression E2 evaluates to 1, and is false if E2 evaluates to false.
The predicate "(sql1>0) op (sql2>0)" is therefore TRUE only if either (1) op is "AND" and both E1 and E2 are true, or (2) op is "OR" and at least one of E1 and E2 are true. If the predicate "(sql1>0) op (sql2>0)" is true, then the "select 1" statement causes a 1 to be returned (indicating true). If the predicate "(sql1>0) op (sql2>0)" is false, then nothing is returned.
Relational expressions are expressions of the type "E1 op E2" where E1 and E2 are expressions and op is a relational operator that maps to one of =, !=, >, <, etc. Relational expressions are rewritten, according to one embodiment, using the following rule:
Literals are stand-alone values, such as numbers, strings, and Booleans true and false. Literals are rewritten, according to one embodiment, using the following rules:
Another feature that is helpful in translating paths into corresponding SQL for querying the XML index is the casting operator. Nodesets are converted to Booleans in case a cast operator appears in the path expression. For example, a cast operator is implicit in an expression of the form /a[b], which selects all the "a" elements that have a "b" element. In these cases, the following SQL, according to one embodiment, is used to generate a Boolean:
Another useful expression to be converted to SQL is the text function. Expressions of the form "P1/text( )" are rewritten, according to one embodiment, to the following SQL expression:
To further utilize the benefit of an XML index, it would be wise, not only to translate path expressions into SQL for querying the XML index, but also to allow for the translation of SQL/XML constructs to be applied against the XML index. This would allow for more user friendly SQL coding. Therefore, in another embodiment of the invention, there are four SQL/XML constructs that are translated which include the existsNode, extractValue, extract, and XMLSequence operators. The invention is not limited to the specific examples given hereafter corresponding to each SQL/XML construct. Each translation of the following SQL/XML constructs illustrates one way such translation may be performed.
The existsNode operator determines whether a particular node, specified by an path, exists in an XML document. If the node is located in an XML document, and consequently in the XML index, then a "1", signifying true, is returned. The existsNode operator is rewritten, according to one embodiment, using the following rule:
select . . . from xmltab T where existsNode(value(T), P) = 1 → select . . . from xmltab T where exists (select 1 from (sql) Q where Q.rid = T.rowid)
where sql is the SQL obtained after applying the rules, defined in the previous sections, on the path expression P, and where xmltab is the base table that contains the XML documents. This rule states in the where clause that the row id of the base table, where the XML document is found, is the same as the Rid of at least one tuple in the results indicated by sql. This condition ensures that only the particular document a user is considering is searched. Because the XML index is spanning multiple XML documents, it is important to ensure that only the applicable XML document in the base table is searched, and not all the XML documents in the base table.
The extractValue operator, given a path expression, returns a single value from the XML index. The extractValue operator is rewritten, according to one embodiment, using the following rule:
select extractValue(value(T), P) from xmltab T → select (select Q.value from (sql) Q where Q.rid = T.rowid) from xmltab T
where sql is the SQL obtained after applying the rules, defined in the previous sections, on the path expression P.
In contrast to the extractValue operator, the extract operator, given a path expression, is used to generate an XML type tree. The extract operator is rewritten, according to one embodiment, using the following rule:
select extract(value(T), P) from xmltab T → select (select xmlagg(get_frag(Q.rid, Q.locator)) from (sql) Q where Q.rid = T.rowid) from xmltab T
where sql is the SQL obtained after applying the rules, defined in the previous sections, on the path expression P, where get_frag is an operator that reads a fragment from the base tables, given a row and a locator, and where xmlagg is an operator that concatenates the fragments generated by the get_frag operator. This rule generates all the rows that are indicated by expression P. For each row, the fragment is retrieved from the base table, T, and aggregated into a single XML type tree. The output of
XMLSequence is an operator that returns a collection of XML instances corresponding to the root elements in the input fragment. For example, XMLSequence(extract(value(T),'/PurchaseOrder/LineItems')) returns a collection of XML instances corresponding to the individual LineItems. The XMLSequence operator is rewritten, according to one embodiment, using the following rule:
select . . . from xmltab T, table(xmlsequence(extract(value(T), P))) T1 where existsNode(value(T1), P1) = 1 → select . . . from xmltab T, (select Q.* from (sql) Q where Q.rid = T.rowid) T1 where exists (select 1 from (sql1) Q1 where Q1.rid = T1.rid and Q1.order_key > T1.order_key and Q1.order_key < maxkey(T1.order_key) and depth(Q1.order_key) = depth(T1.order_key)+1)
where P1 is a path expression, and sql is the SQL obtained after applying the rules, defined in the previous sections, on the path expression P.
In this example, the general existNode rewrite rule described above is not applied because the first operand to the existsNode operator (value(T1)) is generated by operation of the XMLSequence operator.
If a query generation happens to fail, the old functional approach described earlier is used. One situation in which a query generation would fail is when a path expression contains constructs for which the conversion rules are not specified. Another situation in which a query generation would fail is when a rewritten SQL does not have the path_table, or xmltab depending on the context, as a top level object in the from clause.
Computer system 100 may be coupled via bus 102 to a display 112, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 114, including alphanumeric and other keys, is coupled to bus 102 for communicating information and command selections to processor 104. Another type of user input device is cursor control 116, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 104 and for controlling cursor movement on display 112. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.
The invention is related to the use of computer system 100 for implementing the techniques described herein. According to one embodiment of the invention, those techniques are performed by computer system 100 in response to processor 104 executing one or more sequences of one or more instructions contained in main memory 106. Such instructions may be read into main memory 106 from another machine-readable medium, such as storage device 110. Execution of the sequences of instructions contained in main memory 106 causes processor 104 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
The term "machine-readable medium" as used herein refers to any medium that participates in providing data that causes a machine to operation in a specific fashion. In an embodiment implemented using computer system 100, various machine-readable media are involved, for example, in providing instructions to processor 104 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 110. Volatile media includes dynamic memory, such as main memory 106. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 102. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
Common forms of machine-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
Various forms of machine-readable media may be involved in carrying one or more sequences of one or more instructions to processor 104 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 100 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 102. Bus 102 carries the data to main memory 106, from which processor 104 retrieves and executes the instructions. The instructions received by main memory 106 may optionally be stored on storage device 110 either before or after execution by processor 104.
Computer system 100 also includes a communication interface 118 coupled to bus 102. Communication interface 118 provides a two-way data communication coupling to a network link 120 that is connected to a local network 122. For example, communication interface 118 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 118 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 118 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 120 typically provides data communication through one or more networks to other data devices. For example, network link 120 may provide a connection through local network 122 to a host computer 124 or to data equipment operated by an Internet Service Provider (ISP) 126. ISP 126 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the "Internet" 128. Local network 122 and Internet 128 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 120 and through communication interface 118, which carry the digital data to and from computer system 100, are exemplary forms of carrier waves transporting the information.
Computer system 100 can send messages and receive data, including program code, through the network(s), network link 120 and communication interface 118. In the Internet example, a server 130 might transmit a requested code for an application program through Internet 128, ISP 126, local network 122 and communication interface 118.
The received code may be executed by processor 104 as it is received, and/or stored in storage device 110, or other non-volatile storage for later execution. In this manner, computer system 100 may obtain application code in the form of a carrier wave.
In the foregoing specification, embodiments of the invention have been described with reference to numerous specific details that may vary from implementation to implementation. Thus, the sole and exclusive indicator of what is the invention, and is intended by the applicants to be the invention, is the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction. Any definitions expressly set forth herein for terms contained in such claims shall govern the meaning of such terms as used in the claims. Hence, no limitation, element, property, feature, advantage or attribute that is not expressly recited in a claim should limit the scope of such claim in any way. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
|Cited Patent
|Filing date
|Publication date
|Jun 17, 1993
|Apr 4, 1995
|Dimensional Insight, Inc.
|Method for building a database with multi-dimensional search tree nodes
|Apr 12, 1996
|Apr 29, 1997
|Tandem Computers, Incorporated
|Relational database system and method with high data availability during table data restructuring
|May 23, 1994
|May 13, 1997
|Zellweger; Paul
|Method and apparatus for information management using an open hierarchical data structure
|May 20, 1993
|Oct 21, 1997
|Nec Corporation
|Relational database management system
|Feb 28, 1997
|Jul 13, 1999
|Oracle Corporation
|Index selection for an index access path
|Jul 17, 1996
|Sep 28, 1999
|International Business Machines Corporation
|Method for generating a multi-tiered index for partitioned data
|May 15, 1996
|Oct 12, 1999
|Abb Flexible Automation A/S
|Painting robot with a paint supply system
|Sep 29, 1997
|Oct 26, 1999
|Sacks; Jerome E.
|Method and apparatus for implementing a hierarchical database management system (HDBMS) using a relational database management system (RDBMS) as the implementing apparatus
|May 8, 1997
|Nov 9, 1999
|The Trustees Of Columbia University In The City Of New York
|System and method for performing joins and self-joins in a database system
|Mar 16, 1999
|Apr 25, 2000
|Inso Providence Corporation
|Generation of chunks of a long document for an electronic book system
|Aug 25, 1998
|Oct 3, 2000
|Oracle Corporation
|Index with entries that store the key of a row and all non-key values of the row
|Sep 23, 1997
|Oct 31, 2000
|At&T Corp
|Method and apparatus for optimizing and structuring data by designing a cube forest data structure for hierarchically split cube forest template
|Jul 22, 1999
|Mar 27, 2001
|Ori Software Development Ltd.
|Method for organizing directories
|Oct 20, 1998
|Jun 26, 2001
|Microsoft Corporation
|Optimized query tree
|Nov 30, 1998
|Aug 21, 2001
|Microsoft Corporation
|Architecture for managing query friendly hierarchical values
|Aug 31, 1998
|Dec 11, 2001
|Xerox Corporation
|Maintaining document identity across hierarchy and non-hierarchy file systems
|May 6, 1999
|Jan 22, 2002
|International Business Machines Corporation
|Object identity and partitioning for user defined extents
|May 28, 1999
|Apr 2, 2002
|International Business Machines Corp.
|Using an epoch number to optimize access with rowid columns and direct row access
|Jun 19, 1999
|Apr 30, 2002
|Kent Ridge Digital Labs
|System of organizing catalog data for searching and retrieval
|Feb 18, 1999
|Jul 30, 2002
|Oracle Corporation
|Hierarchical indexing for accessing hierarchically organized information in a relational system
|Aug 24, 1999
|Aug 20, 2002
|Oracle Corporation
|Parallel index maintenance
|Aug 27, 1999
|Oct 22, 2002
|Oracle Corporation
|Buffering a hierarchical index of multi-dimensional data
|Aug 27, 1998
|Nov 26, 2002
|Oracle Corporation
|Apparatus and method for aggregate indexes
|May 28, 1999
|Dec 17, 2002
|Survol Interactive Technologies
|Navigating heirarchically organized information
|Feb 8, 2001
|Aug 5, 2003
|At&T Corp.
|Method for converting relational data into a structured document
|Oct 19, 1999
|Oct 7, 2003
|Sybase, Inc.
|Database system providing methodology for optimizing latching/copying costs in index scans on data-only locked tables
|Jan 31, 2002
|Oct 21, 2003
|International Business Machines Corporation
|Generating one or more XML documents from a single SQL query
|Jan 31, 2002
|Nov 4, 2003
|International Business Machines Corporation
|Storing fragmented XML data into a relational database by decomposing XML documents with application specific mappings
|Aug 30, 2000
|Nov 25, 2003
|International Business Machines Corporation
|System and method for query processing and optimization for XML repositories
|Feb 1, 2002
|May 4, 2004
|Silicon Motion, Inc.
|Method for performing flash memory file management
|May 14, 1999
|Aug 3, 2004
|E.Piphany, Inc.
|System and method for controlling access to resources in a distributed environment
|Apr 19, 2001
|Aug 17, 2004
|Microsoft Corporation
|Method and system for creating a database table index using multiple processors
|Apr 14, 2000
|Aug 24, 2004
|David Victor Thede
|Method and system for indexing and searching contents of extensible mark-up language (XML) documents
|Jul 17, 2001
|Sep 21, 2004
|Trendium, Inc.
|Database systems, methods and computer program products including primary key and super key indexes for use with partitioned tables
|Nov 24, 1999
|Nov 30, 2004
|Bitstream Inc.
|Apparatus, methods, programming for automatically laying out documents
|Oct 18, 2001
|Dec 28, 2004
|Sun Microsystems, Inc.
|Mechanism for debugging a computer process
|Mar 22, 2002
|Nov 15, 2005
|International Business Machines Corporation
|Efficient implementation of an index structure for multi-column bi-directional searches
|May 17, 2001
|Apr 11, 2006
|Enosys Markets,Inc.
|System for querying markup language data stored in a relational database according to markup language schema
|Oct 9, 2001
|Apr 18, 2006
|Verizon Laboratories Inc.
|System and method for synchronizing and/or updating an existing relational database with supplemental XML data
|Jan 21, 2000
|May 9, 2006
|International Business Machines Corporation
|Method and system for storing hierarchical content objects in a data repository
|Jun 13, 2001
|May 9, 2006
|Arius Software Corporation
|System and method for multiple level architecture by use of abstract application notation
|Sep 27, 2002
|May 16, 2006
|Oracle Interntional Corporation
|Mechanisms for storing content and properties of hierarchically organized resources
|Feb 24, 2003
|Jun 13, 2006
|The Boeing Company
|Indexing profile for efficient and scalable XML based publish and subscribe system
|Jan 21, 2000
|Aug 8, 2006
|International Business Machines Corporation
|Method and system for preventing mutually exclusive content entities stored in a data repository to be included in the same compilation of content
|Dec 19, 2002
|Oct 17, 2006
|International Business Machines Corporation
|Method, system, and program for optimizing processing of nested functions
|May 5, 2003
|Nov 21, 2006
|Samsung Electronics Co., Ltd.
|Extended markup language (XML) indexing method for processing regular path expression queries in a relational database and a data structure thereof
|Jun 18, 2003
|Jan 9, 2007
|Georg Gottlob
|Efficient processing of XPath queries
|May 30, 2000
|Feb 20, 2007
|Alberti Anemometer, Llc
|Database access system
|Mar 19, 2001
|Nov 1, 2001
|International Business Machines Corporation
|Tagging XML query results over relational DBMSs
|Sep 22, 1997
|Jun 13, 2002
|David W. Deaton
|System, method, and database for processing transactions
|Sep 6, 2001
|Jun 20, 2002
|Muralidhar Krishnaprasad
|Method and apparatus for flexible storage and uniform manipulation of XML data in a relational database system
|Dec 13, 2000
|Jul 18, 2002
|Koskas Elie Ouzi
|Methods of organizing data and processing queries in a database system, and database system and software product for implementing such methods
|Jul 24, 2001
|Jul 25, 2002
|International Business Machines Corporation
|Method of externalizing relational and ASN.1-formatted data into XML format
|Jan 30, 2001
|Aug 1, 2002
|International Business Machines Corporation
|Method, system, program, and data structures for managing structured documents in a database
|Feb 21, 2002
|Aug 22, 2002
|John Eshleman
|Systems and methods for managing distributed database resources
|Mar 28, 2002
|Oct 3, 2002
|Eiji Shamoto
|System simulator, simulation method and simulation program
|May 23, 2001
|Oct 24, 2002
|Krupa Kenneth A.
|System and method for converting an XML data structure into a relational database
|Jan 22, 2002
|Dec 5, 2002
|Srinivas Mandyam
|Method for extracting content from structured or unstructured text documents
|Oct 22, 2001
|Dec 5, 2002
|Kadel Richard William
|Extensible information system
|Oct 19, 2001
|Dec 12, 2002
|Krishneadu Chakraborty
|Method and apparatus for runtime merging of hierarchical trees
|Sep 27, 1999
|Dec 19, 2002
|Mohamed Zait
|Partition pruning with composite partitioning
|Jan 25, 2001
|Jan 9, 2003
|Hancock Brian D.
|Method and system for interfacing with a shipping service
|Jun 26, 2001
|Feb 6, 2003
|William Stutz
|Methods and apparatus for extendible information aggregation and presentation
|Sep 27, 2002
|Feb 13, 2003
|Neema Jalali
|Mechanism to efficiently index structured data that provides hierarchical access in a relational database system
|Sep 27, 2002
|Apr 3, 2003
|Oracle Corporation
|Providing a consistent hierarchical abstraction of relational data
|Oct 18, 2001
|Apr 24, 2003
|Ten-Hove Ronald A.
|Mechanism for facilitating backtracking
|Feb 20, 2001
|Jun 5, 2003
|Kagalwala Raxit A.
|Database schema for structure query language (SQL) server
|Jan 10, 2002
|Jul 10, 2003
|International Business Machines Corporation
|Method, apparatus, and program for distributing a document object model in a web server cluster
|Apr 14, 2003
|Oct 23, 2003
|Doole Douglas J.
|Detection and prevention of writing conflicts within nested query statements
|May 5, 2003
|Nov 13, 2003
|Samsung Electronics Co., Ltd.
|Extended markup language (XML) indexing method for processing regular path expression queries in a relational database and a data structure thereof
|May 10, 2002
|Nov 13, 2003
|Martin Breining
|Querying markup language data sources using a relational query processor
|Jun 16, 2003
|Dec 18, 2003
|Canon Kabushiki Kaisha
|Indexing and querying of structured documents
|Jun 26, 2002
|Jan 8, 2004
|Arthur Zwiegincew
|Manipulating schematized data in a database
|Jul 9, 2002
|Jan 15, 2004
|Lucent Technologies Inc.
|System and method for filtering XML documents with XPath expressions
|Jun 20, 2003
|Jan 22, 2004
|Canon Kabushiki Kaisha
|Methods for interactively defining transforms and for generating queries by manipulating existing query data
|May 1, 2003
|Apr 1, 2004
|Oracle International Corporation
|Techniques for rewriting XML queries directed to relational database constructs
|Jun 13, 2003
|Apr 15, 2004
|Cerisent Corporation
|Parent-child query indexing for XML databases
|May 2, 2003
|Apr 29, 2004
|Robert Pecherer
|Method of recursive objects for representing hierarchies in relational database systems
|Oct 15, 2003
|May 6, 2004
|Russell Perry
|Methods and apparatus for storing hierarchical documents in a relational database
|Jun 13, 2003
|May 27, 2004
|Cerisent Corporation
|Subtree-structured XML database
|Jan 15, 2003
|Jul 22, 2004
|Bohannon Philip L.
|Cost-based storage of extensible markup language (XML) data
|Mar 28, 2003
|Jul 29, 2004
|Amir Milo
|System and method for providing content warehouse
|Feb 20, 2003
|Aug 26, 2004
|Ji-Rong Wen
|Semi-structured data storage schema selection
|Mar 25, 2003
|Sep 30, 2004
|Chia-Hsun Chen
|Path expressions and SQL select statement in object oriented language
|Jul 17, 2003
|Oct 7, 2004
|Michael Rys
|Systems and methods for transforming query results into hierarchical information
|Jul 3, 2001
|Oct 14, 2004
|Julio Santos
|XSL dynamic inheritance
|Oct 11, 2002
|Oct 28, 2004
|International Business Machines Corporation
|File system with access and retrieval of XML documents
|Apr 30, 2003
|Nov 4, 2004
|Oracle International Corporation
|Method and mechanism for processing queries for XML documents using an index
|Jun 23, 2003
|Dec 23, 2004
|Desai Arpan A.
|Common query runtime system and application programming interface
|Jun 27, 2003
|Dec 30, 2004
|Microsoft Corporation
|System and method for managed database query pre-optimization
|Jun 23, 2003
|Dec 30, 2004
|Brundage Michael L.
|Query intermediate language method and system
|Jun 23, 2003
|Jan 6, 2005
|Brundage Michael L.
|Query optimizer system and method
|May 28, 2002
|Jan 27, 2005
|Roberts Baumgartner
|Visual and interactive wrapper generation, automated information extraction from web pages, and translation into xml
|Aug 15, 2003
|Feb 17, 2005
|Collins Albert E.
|System and method for matching local buyers and sellers for the provision of community based services
|Sep 2, 2003
|Mar 3, 2005
|International Business Machines Corporation
|Selective path signatures for query processing over a hierarchical tagged data structure
|Oct 24, 2003
|Apr 28, 2005
|Indexing XML datatype content system and method
|Oct 31, 2003
|May 5, 2005
|Balmin Andrey L.
|XPath containment for index and materialized view matching
|Oct 29, 2003
|May 5, 2005
|Oracle International Corporation
|Network data model for relational database management system
|Nov 7, 2003
|May 12, 2005
|Ibm Corporation
|Single pass workload directed clustering of XML documents
|Nov 26, 2003
|May 26, 2005
|International Business Machines Corporation
|Index structure for supporting structural XML queries
|Oct 18, 2004
|Jun 2, 2005
|Seiko Epson Corporation
|Structured document encoder, method for encoding structured document and program therefor
|Jun 25, 2004
|Jul 21, 2005
|Fujitsu Limited
|Method and apparatus for referring to database integration, and computer product
|Jan 16, 2004
|Jul 21, 2005
|Charlet Kyle J.
|Apparatus, system, and method for passing data between an extensible markup language document and a hierarchical database
|Mar 18, 2004
|Sep 22, 2005
|Microsoft Corporation
|System and method for compiling an extensible markup language based query
|"Written Opinion of the International Preliminary Examining Authority" in International application No. PCT/US2005/020795.
|"XML Fragment Interchange" W3C (1998) pp. 1-16.
|Choi, Byron et al., "The XQuey Formal Semantics: A Foundation for Implementation Optimization," May 31, 2002, IEEE XP-002353605, 15 pages.
|Claims, PCT/US2005/020795, 3 pages.
|Claims, PCT/US2005/021259, dated Nov. 30, 2006, 8 pages (attached).
|Cooper, Brian F. et al., "A Fast Index for Semistructured Data," Proceeding of the International Conference on Very Large Databases, 2001, XP-002303292, pp. 341-350.
|Current Claims PCT/US02/31168, EP App. No. 02799692.5, 8 pages, Jun. 16, 2004.
|Current Claims, PCT/US2005/011763, 4 pages.
|Current Claims, PCT/US2005/020795, 5 pages.
|Current Claims, PCT/US2005/021259, 10 pages.
|Current Claims, PCT/US2005/021259, 12 pages.
|Daniele Braga et al., "A Graphical Environment to Query XML Data with Query," Proceedings of the Fourth International Conference on Web Information Systems Engineering (WISE '03), 2003, IEEE, 10 pages.
|European Patent Office, "Communication Pursuant to Article 96(2) EPC," EP App. No. 02799692.5, dated Jan. 18, 2006, 5 pages.
|Funderbunk, J. et al., "XML programming with SQL/XML and XQuery", IBM Systems Journal, XP-002295973 (2002), pp. 642-665.
|International Preli minary Examining Authority, "Written Opinion," PCT/US2005/021259, dated Oct. 13, 2006, 7 pages.
|International Preliminary Examining Authority, "Notification of Transmittal of the International Preliminary Report of Patentability," PCT/US2005/020795, dated Aug. 7, 2006, 10 pages.
|International Preliminary Examining Authority, "Notification of Transmittal of the International Preliminary Report on Patentability," PCT/US2005/021259, dated Feb. 2, 2007, 9 pages.
|International Preliminary Examining Authority, "Written Opinion of the International Preliminary Examining Authority," PCT/US2005/020795, received May 31, 2006, 5 pages.
|International Searching Authority, "Notification of the Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration," PCT/US2005/020795, Mailing Date Sep. 27, 2005, 13 pages.
|International Searching Authority, "Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration," PCT/US2005/011763, dated Aug. 6, 2005, 12 pages.
|International Searching Authority, "Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration," PCT/US2005/021259, dated Nov. 24, 2005, 13 pages.
|Jurgens, Marcus, et al., "PISA: Performance Models for Index Structures with and without Aggregated data" German Research Society, 1999, 7 pages.
|Kang, Ji-Hoon et al., "An XQuery Engine for Digital Library Systems that support XML data," Proceedings of the 2004 International Symposium on Application and the Internet Workshops, IEEE XP010684128, 5 pages.
|Katz, Howard et al., "Integrating XQuery and Relational Database Systems," Chapter 7-XQuery from the Experts: A Guide to the W3C XML Query Language, Addison Wesley Professional, Aug. 22, 2003, ISBM 978-0-321-18060-5, pp. 353-391.
|Kudrass, Thomas, "Management of XML Documents Without Schema in Relational Database Systems," Information and Software Technology, vol. 44, No. 4, Mar. 31, 2002, XP-004347776, pp. 269-275.
|Lo et al., "XAS: A System for Accessing Componentized, Virtual XML Documents," IEEE, 2001, pp. 493-502.
|MacKenzie, David et al., "Finding Files", GNU Findutils Version 4.1.2, Nov. 1994, 38 pages.
|McHugh, Jason et al., "Query Optimization for XML", XP-002333353, Proceedings of the 25<SUP>th </SUP>VLDB Conference (1999) pp. 315-326.
|McHugh, Jason, et al. "Indexing Semistructured Data," Stanford Science Department, 1998, XP-002248313, pp. 1-21.
|Murthy, Ravi et al., "XML Schemas in Oracle XML DB," Proceedings of the 29th VLDB Conference, 2003, XP-002353604, pp. 1009-1018.
|Myllymaki, Jussi, "Effective Wed data Extraction with Standard XML Technologies," WWW10, May 1-5, 2001, pp. 689-696.
|Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration received from International application No. PCT/US2005/011762.
|Pal, Shankar et al., "Indexing XML Data Stored in a Relational Database", Proceedings of the 30<SUP>th </SUP>VLDB Conference, 2004, 12 pages.
|Pending claims from International application No. PCT/US2005/011762.
|Rys, Michael et al., "Integrating XQuery and Relational Database Systems," Chapter 7-XQuery from the Experts: A Guide to the W3C XML Query Language, Addison Wesley Professional, Aug. 22, 2003, ISBN 978-0-321-18060-5, pp. 353-391.
|Schmidt et al., "Why and How to Benchmark XML Databases," SIGMOND Record, vol. 3, No. 3, Sep. 2001, pp. 27-32.
|Shanmugasundaram, Jayavel, et al., "Querying XML Views of Relational Data," Proceedings of the 27<SUP>th </SUP>Very Large Databases Conference, Rome, Italy, Sep. 2001, pp. 261-270.
|W3C, "XML Fragment Interchange," W3C Working Draft, Jun. 30, 1999, XP-002167090, 17 pages.
|W3C, "XML Path Language (XPath) 2.0," W3C Recommendation, Working Draft, Oct. 29, 2004, retrieved from the internet:<http://www.w3.org/TR/2004/WD-xpath20-20041029>, retrieved on Apr. 14, 2005, pp. 1-111.
|W3C, "XML Syntax for XQuery 1.0 (XQueryX)," W3C Recommendation, Working Draft, Dec. 19, 2003, retrieved from the internet:<http://www.w3.org/TR/2003/WD-xquery-20031219>, retrieved on Apr. 14, 2005, pp. 1-55.
|W3C, "XQuery 1.0: An XML Query Language," W3C Recommendation, Working Draft, Oct. 29, 2004, retrieved from the internet:<http://www.w3.org/TR/2004/WD-xquery-20041029>, retrieved on Apr. 14, 2005, pp. 1-189.
|Yoshikawa, Masatoshi et al., "XRel: A Path-Based Approach to Storage and Retrieval of XML Documents Using Relationship Databases", XP-001143686, ACM Transactions on Internet Technology (2001), pp. 110-141.
|Zemke, Fred, "XMLQuery," Change Proposal, ISO/IEC JTC1/SC32 WG3:SIA-nnn ANSI NCITS H2-2004-021rl, Mar. 14, 2004, 29 pages.
|Zhang, Hui et al., "XQuery rewriting at the relational algebra level," Computer Systems Science and Engineering, vol. 18, No. 5, Sep. 2003, IEEE XP-009056809, pp. 241-262.
|Zhang, Wansong, et al., "An Encoding Scheme for Indexing XML Data," E-Commerce and E-Service, 2004, XP-010697639, pp. 526-529.
|Zhang, Xin et al., "Honey, I Shrunk the XQuery!-An XML Algebra Optimization Approach," Submission for WIDM'02, IEEE XP-002316448, 14 pages.
|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.
|Citing Patent
|Filing date
|Publication date
|Feb 16, 2007
|Dec 1, 2009
|Oracle International Corporation
|Encoding insignificant whitespace of XML data
|Mar 31, 2006
|Jan 5, 2010
|Oracle International Corporation
|Techniques of efficient XML meta-data query using XML table index
|Mar 26, 2007
|Dec 28, 2010
|Oracle International Corporation
|Automatically determining a database representation for an abstract datatype
|Dec 13, 2007
|Jan 11, 2011
|Oracle International Corporation
|Rewriting node reference-based XQuery using SQL/SML
|Jul 28, 2008
|Jan 3, 2012
|Oracle International Corporation
|Document fidelity with binary XML storage
|Oct 11, 2006
|Jan 31, 2012
|International Business Machines Corporation
|Identifying and annotating shared hierarchical markup document trees
|Dec 30, 2008
|Feb 28, 2012
|Oracle International Corporation
|Indexing strategy with improved DML performance and space usage for node-aware full-text search over XML
|Dec 30, 2008
|Jul 10, 2012
|Oracle International Corporation
|Indexing mechanism for efficient node-aware full-text search over XML
|Nov 9, 2007
|Aug 21, 2012
|Oracle International Corporation
|Optimized streaming evaluation of XML queries
|Jul 14, 2005
|Jan 1, 2013
|Oracle International Corporation
|Encoding of hierarchically organized data for efficient storage and processing
|Jun 8, 2009
|Jan 29, 2013
|International Business Machines Corporation
|Servicing query with access path security in relational database management system
|Nov 17, 2006
|Jul 2, 2013
|Oracle International Corporation
|Techniques of efficient query over text, image, audio, video and other domain specific data in XML using XML table index with integration of text index and other domain specific indexes
|Oct 11, 2006
|Jan 21, 2014
|International Business Machines Corporation
|Processing queries on hierarchical markup data using shared hierarchical markup trees
|Sep 27, 2010
|Sep 15, 2015
|International Business Machines Corporation
|XPath evaluation in an XML repository
|Jul 14, 2005
|Sep 21, 2006
|Ravi Murthy
|Encoding of hierarchically organized data for efficient storage and processing
|Aug 21, 2009
|Feb 24, 2011
|Oracle International Corporation
|Xml query optimization with order analysis of xml schema
|Mar 31, 2011
|International Business Machines Corporation
|Xpath evaluation in an xml repository
|U.S. Classification
|1/1, 715/234, 707/999.002, 707/999.005, 707/999.104
|International Classification
|Cooperative Classification
|European Classification
|Sep 16, 2004
Owner name: ORACLE INTERNATIONAL CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:THUSOO, ASHISH;MURTHY, RAVI;CHANDRASEKAR, SIVASANKARAN;AND OTHERS;REEL/FRAME:015805/0639;SIGNING DATES FROM 20040826 TO 20040830
|Nov 10, 2009
|Certificate of correction
|Sep 21, 2011
|Fee payment
Year of fee payment: 4