Answering exact distance queries on real-world graphs with bounded performance guarantees
Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach ha...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Xiang, Yang [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2013 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag Berlin Heidelberg 2013 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The VLDB journal - Springer Berlin Heidelberg, 1992, 23(2013), 5 vom: 29. Sept., Seite 677-695 |
|---|---|
| Übergeordnetes Werk: |
volume:23 ; year:2013 ; number:5 ; day:29 ; month:09 ; pages:677-695 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00778-013-0338-6 |
|---|
| Katalog-ID: |
OLC2051360162 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2051360162 | ||
| 003 | DE-627 | ||
| 005 | 20230502152005.0 | ||
| 007 | tu | ||
| 008 | 200819s2013 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00778-013-0338-6 |2 doi | |
| 035 | |a (DE-627)OLC2051360162 | ||
| 035 | |a (DE-He213)s00778-013-0338-6-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Xiang, Yang |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Answering exact distance queries on real-world graphs with bounded performance guarantees |
| 264 | 1 | |c 2013 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag Berlin Heidelberg 2013 | ||
| 520 | |a Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. | ||
| 650 | 4 | |a Graph databases | |
| 650 | 4 | |a Tree decomposition | |
| 650 | 4 | |a Exact distance queries | |
| 773 | 0 | 8 | |i Enthalten in |t The VLDB journal |d Springer Berlin Heidelberg, 1992 |g 23(2013), 5 vom: 29. Sept., Seite 677-695 |w (DE-627)170933059 |w (DE-600)1129061-4 |w (DE-576)032856466 |x 1066-8888 |7 nnns |
| 773 | 1 | 8 | |g volume:23 |g year:2013 |g number:5 |g day:29 |g month:09 |g pages:677-695 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00778-013-0338-6 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_32 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2005 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4311 | ||
| 951 | |a AR | ||
| 952 | |d 23 |j 2013 |e 5 |b 29 |c 09 |h 677-695 | ||
| author_variant |
y x yx |
|---|---|
| matchkey_str |
article:10668888:2013----::nwrneatitneureorawrdrpsihone |
| hierarchy_sort_str |
2013 |
| publishDate |
2013 |
| allfields |
10.1007/s00778-013-0338-6 doi (DE-627)OLC2051360162 (DE-He213)s00778-013-0338-6-p DE-627 ger DE-627 rakwb eng 004 VZ Xiang, Yang verfasserin aut Answering exact distance queries on real-world graphs with bounded performance guarantees 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. Graph databases Tree decomposition Exact distance queries Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 23(2013), 5 vom: 29. Sept., Seite 677-695 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:23 year:2013 number:5 day:29 month:09 pages:677-695 https://doi.org/10.1007/s00778-013-0338-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_32 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4311 AR 23 2013 5 29 09 677-695 |
| spelling |
10.1007/s00778-013-0338-6 doi (DE-627)OLC2051360162 (DE-He213)s00778-013-0338-6-p DE-627 ger DE-627 rakwb eng 004 VZ Xiang, Yang verfasserin aut Answering exact distance queries on real-world graphs with bounded performance guarantees 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. Graph databases Tree decomposition Exact distance queries Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 23(2013), 5 vom: 29. Sept., Seite 677-695 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:23 year:2013 number:5 day:29 month:09 pages:677-695 https://doi.org/10.1007/s00778-013-0338-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_32 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4311 AR 23 2013 5 29 09 677-695 |
| allfields_unstemmed |
10.1007/s00778-013-0338-6 doi (DE-627)OLC2051360162 (DE-He213)s00778-013-0338-6-p DE-627 ger DE-627 rakwb eng 004 VZ Xiang, Yang verfasserin aut Answering exact distance queries on real-world graphs with bounded performance guarantees 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. Graph databases Tree decomposition Exact distance queries Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 23(2013), 5 vom: 29. Sept., Seite 677-695 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:23 year:2013 number:5 day:29 month:09 pages:677-695 https://doi.org/10.1007/s00778-013-0338-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_32 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4311 AR 23 2013 5 29 09 677-695 |
| allfieldsGer |
10.1007/s00778-013-0338-6 doi (DE-627)OLC2051360162 (DE-He213)s00778-013-0338-6-p DE-627 ger DE-627 rakwb eng 004 VZ Xiang, Yang verfasserin aut Answering exact distance queries on real-world graphs with bounded performance guarantees 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. Graph databases Tree decomposition Exact distance queries Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 23(2013), 5 vom: 29. Sept., Seite 677-695 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:23 year:2013 number:5 day:29 month:09 pages:677-695 https://doi.org/10.1007/s00778-013-0338-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_32 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4311 AR 23 2013 5 29 09 677-695 |
| allfieldsSound |
10.1007/s00778-013-0338-6 doi (DE-627)OLC2051360162 (DE-He213)s00778-013-0338-6-p DE-627 ger DE-627 rakwb eng 004 VZ Xiang, Yang verfasserin aut Answering exact distance queries on real-world graphs with bounded performance guarantees 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. Graph databases Tree decomposition Exact distance queries Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 23(2013), 5 vom: 29. Sept., Seite 677-695 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:23 year:2013 number:5 day:29 month:09 pages:677-695 https://doi.org/10.1007/s00778-013-0338-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_32 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4311 AR 23 2013 5 29 09 677-695 |
| language |
English |
| source |
Enthalten in The VLDB journal 23(2013), 5 vom: 29. Sept., Seite 677-695 volume:23 year:2013 number:5 day:29 month:09 pages:677-695 |
| sourceStr |
Enthalten in The VLDB journal 23(2013), 5 vom: 29. Sept., Seite 677-695 volume:23 year:2013 number:5 day:29 month:09 pages:677-695 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Graph databases Tree decomposition Exact distance queries |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
The VLDB journal |
| authorswithroles_txt_mv |
Xiang, Yang @@aut@@ |
| publishDateDaySort_date |
2013-09-29T00:00:00Z |
| hierarchy_top_id |
170933059 |
| dewey-sort |
14 |
| id |
OLC2051360162 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2051360162</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502152005.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2013 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00778-013-0338-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051360162</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00778-013-0338-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Xiang, Yang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Answering exact distance queries on real-world graphs with bounded performance guarantees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag Berlin Heidelberg 2013</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tree decomposition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Exact distance queries</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The VLDB journal</subfield><subfield code="d">Springer Berlin Heidelberg, 1992</subfield><subfield code="g">23(2013), 5 vom: 29. Sept., Seite 677-695</subfield><subfield code="w">(DE-627)170933059</subfield><subfield code="w">(DE-600)1129061-4</subfield><subfield code="w">(DE-576)032856466</subfield><subfield code="x">1066-8888</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:23</subfield><subfield code="g">year:2013</subfield><subfield code="g">number:5</subfield><subfield code="g">day:29</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:677-695</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00778-013-0338-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">23</subfield><subfield code="j">2013</subfield><subfield code="e">5</subfield><subfield code="b">29</subfield><subfield code="c">09</subfield><subfield code="h">677-695</subfield></datafield></record></collection>
|
| author |
Xiang, Yang |
| spellingShingle |
Xiang, Yang ddc 004 misc Graph databases misc Tree decomposition misc Exact distance queries Answering exact distance queries on real-world graphs with bounded performance guarantees |
| authorStr |
Xiang, Yang |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)170933059 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1066-8888 |
| topic_title |
004 VZ Answering exact distance queries on real-world graphs with bounded performance guarantees Graph databases Tree decomposition Exact distance queries |
| topic |
ddc 004 misc Graph databases misc Tree decomposition misc Exact distance queries |
| topic_unstemmed |
ddc 004 misc Graph databases misc Tree decomposition misc Exact distance queries |
| topic_browse |
ddc 004 misc Graph databases misc Tree decomposition misc Exact distance queries |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
The VLDB journal |
| hierarchy_parent_id |
170933059 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
The VLDB journal |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 |
| title |
Answering exact distance queries on real-world graphs with bounded performance guarantees |
| ctrlnum |
(DE-627)OLC2051360162 (DE-He213)s00778-013-0338-6-p |
| title_full |
Answering exact distance queries on real-world graphs with bounded performance guarantees |
| author_sort |
Xiang, Yang |
| journal |
The VLDB journal |
| journalStr |
The VLDB journal |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2013 |
| contenttype_str_mv |
txt |
| container_start_page |
677 |
| author_browse |
Xiang, Yang |
| container_volume |
23 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Xiang, Yang |
| doi_str_mv |
10.1007/s00778-013-0338-6 |
| dewey-full |
004 |
| title_sort |
answering exact distance queries on real-world graphs with bounded performance guarantees |
| title_auth |
Answering exact distance queries on real-world graphs with bounded performance guarantees |
| abstract |
Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. © Springer-Verlag Berlin Heidelberg 2013 |
| abstractGer |
Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. © Springer-Verlag Berlin Heidelberg 2013 |
| abstract_unstemmed |
Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries. © Springer-Verlag Berlin Heidelberg 2013 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_32 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4311 |
| container_issue |
5 |
| title_short |
Answering exact distance queries on real-world graphs with bounded performance guarantees |
| url |
https://doi.org/10.1007/s00778-013-0338-6 |
| remote_bool |
false |
| ppnlink |
170933059 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00778-013-0338-6 |
| up_date |
2024-07-04T04:12:50.005Z |
| _version_ |
1803620313996460032 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2051360162</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502152005.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2013 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00778-013-0338-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051360162</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00778-013-0338-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Xiang, Yang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Answering exact distance queries on real-world graphs with bounded performance guarantees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag Berlin Heidelberg 2013</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The ability to efficiently obtain exact distance information from both directed and undirected graphs is desired by many real-world applications. In this work, we unified the query indexing efforts on directed and undirected graphs into one by proposing the TreeMap approach. Our approach has very tight bounds on query time, index size, and construction time for answering queries on both directed and undirected graphs. The query time complexity is close to constant for graphs with a small width of tree decomposition, and the index construction can be completed without materializing the distance matrix or other high-cost operations. In the empirical study, we demonstrated that the TreeMap approach in general performs much better than competitive methods in indexing real graphs for answering exact distance queries.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tree decomposition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Exact distance queries</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The VLDB journal</subfield><subfield code="d">Springer Berlin Heidelberg, 1992</subfield><subfield code="g">23(2013), 5 vom: 29. Sept., Seite 677-695</subfield><subfield code="w">(DE-627)170933059</subfield><subfield code="w">(DE-600)1129061-4</subfield><subfield code="w">(DE-576)032856466</subfield><subfield code="x">1066-8888</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:23</subfield><subfield code="g">year:2013</subfield><subfield code="g">number:5</subfield><subfield code="g">day:29</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:677-695</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00778-013-0338-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">23</subfield><subfield code="j">2013</subfield><subfield code="e">5</subfield><subfield code="b">29</subfield><subfield code="c">09</subfield><subfield code="h">677-695</subfield></datafield></record></collection>
|
| score |
7.398695 |