Database system with methodogy providing faster N-ary nested loop joins


Ontology type: sgo:Patent     


Patent Info

DATE

2002-12-10T00:00

AUTHORS

Nagavamsi Ponnekanti

ABSTRACT

A database system implementing a methodology or technique that can be used to optimize processing of nested loop joins of three or more tables (n-ary NLJs for n>2) more efficiently is described. In implementation, upon encountering a failure condition (i.e., a given join condition does not hold true) from a join operator (scan child), context information (about the failure) is returned (to the n-ary nested-loop join operator) for indicating exactly which condition (i.e., join condition) failed. This information is tracked in a scan descriptor, which includes a “fail sarg” data field indicating exactly which particular search argument (“sarg”) failed. Based on this information, the system (operating through the n-ary nested-loop join operator) knows exactly which scan child to return back to (i.e., how far back to go in the join order to fetch the next row). In this manner, the methodology optimizes processing of n-ary nested loop joins by eliminating comparisons that will not hold true for the corresponding join condition (for which the comparisons were to be tested). More... »

Related SciGraph Publications

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/2790", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "name": "Nagavamsi Ponnekanti", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1145/6314.6315", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1005153896"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/211990.212001", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1026244621"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s007780050036", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048826116", 
          "https://doi.org/10.1007/s007780050036"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2002-12-10T00:00", 
    "description": "

A database system implementing a methodology or technique that can be used to optimize processing of nested loop joins of three or more tables (n-ary NLJs for n>2) more efficiently is described. In implementation, upon encountering a failure condition (i.e., a given join condition does not hold true) from a join operator (scan child), context information (about the failure) is returned (to the n-ary nested-loop join operator) for indicating exactly which condition (i.e., join condition) failed. This information is tracked in a scan descriptor, which includes a “fail sarg” data field indicating exactly which particular search argument (“sarg”) failed. Based on this information, the system (operating through the n-ary nested-loop join operator) knows exactly which scan child to return back to (i.e., how far back to go in the join order to fetch the next row). In this manner, the methodology optimizes processing of n-ary nested loop joins by eliminating comparisons that will not hold true for the corresponding join condition (for which the comparisons were to be tested).

", "id": "sg:patent.US-6493701-B2", "keywords": [ "database system", "loop", "methodology", "technique", "processing", "NS", "N2", "implementation", "condition", "operator", "child", "context information", "failure", "Subject Heading", "data field", "argument", "row", "comparison" ], "name": "Database system with methodogy providing faster N-ary nested loop joins", "recipient": [ { "id": "https://www.grid.ac/institutes/grid.467551.4", "type": "Organization" } ], "sameAs": [ "https://app.dimensions.ai/details/patent/US-6493701-B2" ], "sdDataset": "patents", "sdDatePublished": "2019-04-18T10:27", "sdLicense": "https://scigraph.springernature.com/explorer/license/", "sdPublisher": { "name": "Springer Nature - SN SciGraph project", "type": "Organization" }, "sdSource": "s3://com-uberresearch-data-patents-target-20190320-rc/data/sn-export/402f166718b70575fb5d4ffe01f064d1/0000100128-0000352499/json_export_03115.jsonl", "type": "Patent" } ]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/patent.US-6493701-B2'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/patent.US-6493701-B2'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/patent.US-6493701-B2'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/patent.US-6493701-B2'


 

This table displays all metadata directly associated to this object as RDF triples.

50 TRIPLES      15 PREDICATES      35 URIs      26 LITERALS      2 BLANK NODES

Subject Predicate Object
1 sg:patent.US-6493701-B2 schema:about anzsrc-for:2790
2 schema:author N5635ae150c654fcfa2706b3891e42432
3 schema:citation sg:pub.10.1007/s007780050036
4 https://doi.org/10.1145/211990.212001
5 https://doi.org/10.1145/6314.6315
6 schema:datePublished 2002-12-10T00:00
7 schema:description <p>A database system implementing a methodology or technique that can be used to optimize processing of nested loop joins of three or more tables (n-ary NLJs for n&gt;2) more efficiently is described. In implementation, upon encountering a failure condition (i.e., a given join condition does not hold true) from a join operator (scan child), context information (about the failure) is returned (to the n-ary nested-loop join operator) for indicating exactly which condition (i.e., join condition) failed. This information is tracked in a scan descriptor, which includes a &#8220;fail sarg&#8221; data field indicating exactly which particular search argument (&#8220;sarg&#8221;) failed. Based on this information, the system (operating through the n-ary nested-loop join operator) knows exactly which scan child to return back to (i.e., how far back to go in the join order to fetch the next row). In this manner, the methodology optimizes processing of n-ary nested loop joins by eliminating comparisons that will not hold true for the corresponding join condition (for which the comparisons were to be tested).</p>
8 schema:keywords N2
9 NS
10 Subject Heading
11 argument
12 child
13 comparison
14 condition
15 context information
16 data field
17 database system
18 failure
19 implementation
20 loop
21 methodology
22 operator
23 processing
24 row
25 technique
26 schema:name Database system with methodogy providing faster N-ary nested loop joins
27 schema:recipient https://www.grid.ac/institutes/grid.467551.4
28 schema:sameAs https://app.dimensions.ai/details/patent/US-6493701-B2
29 schema:sdDatePublished 2019-04-18T10:27
30 schema:sdLicense https://scigraph.springernature.com/explorer/license/
31 schema:sdPublisher Nb91425f92d984da6ad31976adbe1034f
32 sgo:license sg:explorer/license/
33 sgo:sdDataset patents
34 rdf:type sgo:Patent
35 N5635ae150c654fcfa2706b3891e42432 rdf:first Ne8ee087ec0ff42b4be1f1c5c4d7f8879
36 rdf:rest rdf:nil
37 Nb91425f92d984da6ad31976adbe1034f schema:name Springer Nature - SN SciGraph project
38 rdf:type schema:Organization
39 Ne8ee087ec0ff42b4be1f1c5c4d7f8879 schema:name Nagavamsi Ponnekanti
40 rdf:type schema:Person
41 anzsrc-for:2790 schema:inDefinedTermSet anzsrc-for:
42 rdf:type schema:DefinedTerm
43 sg:pub.10.1007/s007780050036 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048826116
44 https://doi.org/10.1007/s007780050036
45 rdf:type schema:CreativeWork
46 https://doi.org/10.1145/211990.212001 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026244621
47 rdf:type schema:CreativeWork
48 https://doi.org/10.1145/6314.6315 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005153896
49 rdf:type schema:CreativeWork
50 https://www.grid.ac/institutes/grid.467551.4 schema:Organization
 




Preview window. Press ESC to close (or click here)


...