Tree-based techniques for query evaluation: by Hakan Jakobsson
Abstract: "Databases model relationships between entities and such relationships can often be represented as edges in directed graphs. Database queries that construct new relationships by joining existing ones typically correspond to various kinds of reachability problems in graphs. We investig...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1993
|
| Series: | Stanford University / Computer Science Department: Report STAN CS
1492 |
| Subjects: | |
| Summary: | Abstract: "Databases model relationships between entities and such relationships can often be represented as edges in directed graphs. Database queries that construct new relationships by joining existing ones typically correspond to various kinds of reachability problems in graphs. We investigate techniques for solving such reachability problems based on the idea of storing intermediary results that are formed during the computation as trees, where the structures of the trees reflect how the intermediary results were derived. The advantage is that when the trees are used in later steps of the computation, their structures can be used to avoid deriving many duplicate or irrelevant results. We give algorithms using tree-based techniques for a number of transitive closure and shortest paths problems We analyze these algorithms using connectivity measures relating to the number of node-disjoint paths between the nodes in the graph. In particular, the pairwise connectivity of two nodes, x and y, denoted CONN(x, y)), is an interesting measure. We show that, unlike previous algorithms, our tree-based transitive closure algorithms have upper bounds that are O([sigma][subscript (x, y)] [element of] v x v CONN (x, y)). We compare our algorithms to several others based on different approaches and show that using trees can lead to great improvements in many cases and, even in the worst case, introduces only a marginal overhead compared to standard techniques. We discuss some factors that determine the actual improvements We also consider the join-ordering problem that arises when several relations are composed and show that a simple cheapest-first heuristic works much better with tree-based compositions than with standard ones. |
| Item Description: | Stanford, Calif., Univ., Diss. |
| Physical Description: | VIII, 59 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009041456 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 m||| 00||| eng d | ||
| 035 | |a (OCoLC)31371869 | ||
| 035 | |a (DE-599)BVBBV009041456 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Jakobsson, Hakan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Tree-based techniques for query evaluation |b by Hakan Jakobsson |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a VIII, 59 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1492 | |
| 500 | |a Stanford, Calif., Univ., Diss. | ||
| 520 | 3 | |a Abstract: "Databases model relationships between entities and such relationships can often be represented as edges in directed graphs. Database queries that construct new relationships by joining existing ones typically correspond to various kinds of reachability problems in graphs. We investigate techniques for solving such reachability problems based on the idea of storing intermediary results that are formed during the computation as trees, where the structures of the trees reflect how the intermediary results were derived. The advantage is that when the trees are used in later steps of the computation, their structures can be used to avoid deriving many duplicate or irrelevant results. We give algorithms using tree-based techniques for a number of transitive closure and shortest paths problems | |
| 520 | 3 | |a We analyze these algorithms using connectivity measures relating to the number of node-disjoint paths between the nodes in the graph. In particular, the pairwise connectivity of two nodes, x and y, denoted CONN(x, y)), is an interesting measure. We show that, unlike previous algorithms, our tree-based transitive closure algorithms have upper bounds that are O([sigma][subscript (x, y)] [element of] v x v CONN (x, y)). We compare our algorithms to several others based on different approaches and show that using trees can lead to great improvements in many cases and, even in the worst case, introduces only a marginal overhead compared to standard techniques. We discuss some factors that determine the actual improvements | |
| 520 | 3 | |a We also consider the join-ordering problem that arises when several relations are composed and show that a simple cheapest-first heuristic works much better with tree-based compositions than with standard ones. | |
| 650 | 4 | |a Database management | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1492 |w (DE-604)BV008928280 |9 1492 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005982780 | ||
Record in the Search Index
| _version_ | 1804123396252893184 |
|---|---|
| any_adam_object | |
| author | Jakobsson, Hakan |
| author_facet | Jakobsson, Hakan |
| author_role | aut |
| author_sort | Jakobsson, Hakan |
| author_variant | h j hj |
| building | Verbundindex |
| bvnumber | BV009041456 |
| ctrlnum | (OCoLC)31371869 (DE-599)BVBBV009041456 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02799nam a2200337 cb4500</leader><controlfield tag="001">BV009041456</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31371869</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009041456</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jakobsson, Hakan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tree-based techniques for query evaluation</subfield><subfield code="b">by Hakan Jakobsson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 59 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1492</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Stanford, Calif., Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Databases model relationships between entities and such relationships can often be represented as edges in directed graphs. Database queries that construct new relationships by joining existing ones typically correspond to various kinds of reachability problems in graphs. We investigate techniques for solving such reachability problems based on the idea of storing intermediary results that are formed during the computation as trees, where the structures of the trees reflect how the intermediary results were derived. The advantage is that when the trees are used in later steps of the computation, their structures can be used to avoid deriving many duplicate or irrelevant results. We give algorithms using tree-based techniques for a number of transitive closure and shortest paths problems</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We analyze these algorithms using connectivity measures relating to the number of node-disjoint paths between the nodes in the graph. In particular, the pairwise connectivity of two nodes, x and y, denoted CONN(x, y)), is an interesting measure. We show that, unlike previous algorithms, our tree-based transitive closure algorithms have upper bounds that are O([sigma][subscript (x, y)] [element of] v x v CONN (x, y)). We compare our algorithms to several others based on different approaches and show that using trees can lead to great improvements in many cases and, even in the worst case, introduces only a marginal overhead compared to standard techniques. We discuss some factors that determine the actual improvements</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We also consider the join-ordering problem that arises when several relations are composed and show that a simple cheapest-first heuristic works much better with tree-based compositions than with standard ones.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1492</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1492</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005982780</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009041456 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005982780 |
| oclc_num | 31371869 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | VIII, 59 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Jakobsson, Hakan Verfasser aut Tree-based techniques for query evaluation by Hakan Jakobsson Stanford, Calif. 1993 VIII, 59 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1492 Stanford, Calif., Univ., Diss. Abstract: "Databases model relationships between entities and such relationships can often be represented as edges in directed graphs. Database queries that construct new relationships by joining existing ones typically correspond to various kinds of reachability problems in graphs. We investigate techniques for solving such reachability problems based on the idea of storing intermediary results that are formed during the computation as trees, where the structures of the trees reflect how the intermediary results were derived. The advantage is that when the trees are used in later steps of the computation, their structures can be used to avoid deriving many duplicate or irrelevant results. We give algorithms using tree-based techniques for a number of transitive closure and shortest paths problems We analyze these algorithms using connectivity measures relating to the number of node-disjoint paths between the nodes in the graph. In particular, the pairwise connectivity of two nodes, x and y, denoted CONN(x, y)), is an interesting measure. We show that, unlike previous algorithms, our tree-based transitive closure algorithms have upper bounds that are O([sigma][subscript (x, y)] [element of] v x v CONN (x, y)). We compare our algorithms to several others based on different approaches and show that using trees can lead to great improvements in many cases and, even in the worst case, introduces only a marginal overhead compared to standard techniques. We discuss some factors that determine the actual improvements We also consider the join-ordering problem that arises when several relations are composed and show that a simple cheapest-first heuristic works much better with tree-based compositions than with standard ones. Database management (DE-588)4113937-9 Hochschulschrift gnd-content Computer Science Department: Report STAN CS Stanford University 1492 (DE-604)BV008928280 1492 |
| spellingShingle | Jakobsson, Hakan Tree-based techniques for query evaluation by Hakan Jakobsson Database management |
| subject_GND | (DE-588)4113937-9 |
| title | Tree-based techniques for query evaluation by Hakan Jakobsson |
| title_auth | Tree-based techniques for query evaluation by Hakan Jakobsson |
| title_exact_search | Tree-based techniques for query evaluation by Hakan Jakobsson |
| title_full | Tree-based techniques for query evaluation by Hakan Jakobsson |
| title_fullStr | Tree-based techniques for query evaluation by Hakan Jakobsson |
| title_full_unstemmed | Tree-based techniques for query evaluation by Hakan Jakobsson |
| title_short | Tree-based techniques for query evaluation |
| title_sort | tree based techniques for query evaluation by hakan jakobsson |
| title_sub | by Hakan Jakobsson |
| topic | Database management |
| topic_facet | Database management Hochschulschrift |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT jakobssonhakan treebasedtechniquesforqueryevaluationbyhakanjakobsson |