Merging partitioned databases:
Partitioning of a distributed data base requires either that update activity be restricted or that a strategy for conflict resolution and partition merging be used once communication is restored. The graph-theoretic approach used by Davidson follows the latter approach and can be used to show that f...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1983
|
| Zusammenfassung: | Partitioning of a distributed data base requires either that update activity be restricted or that a strategy for conflict resolution and partition merging be used once communication is restored. The graph-theoretic approach used by Davidson follows the latter approach and can be used to show that finding an optimum solution to the general problem is NP-complete. We give several methods of reducing the size of the graphs involved. Two open subproblems are shown to be NP-complete, while an extension of a known polynomial-time subproblem is given. Simulation results are used to study both the amount of compression achieved by the graph reduction techniques and their effects on heuristics for the problem. In addition, some modifications are made to existing heuristics to improve their performance. A probabilistic model is presented and compared with the simulations. |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010586477 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960126s1983 |||| 00||| engod | ||
| 035 | |a (OCoLC)10796038 | ||
| 035 | |a (DE-599)BVBBV010586477 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA76.9.D3 | |
| 082 | 0 | |a 001.642 |2 19 | |
| 100 | 1 | |a Wright, David D. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Merging partitioned databases |c David D. Wright ; Dale Skeen |
| 264 | 1 | |a Ithaca, New York |c 1983 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Partitioning of a distributed data base requires either that update activity be restricted or that a strategy for conflict resolution and partition merging be used once communication is restored. The graph-theoretic approach used by Davidson follows the latter approach and can be used to show that finding an optimum solution to the general problem is NP-complete. We give several methods of reducing the size of the graphs involved. Two open subproblems are shown to be NP-complete, while an extension of a known polynomial-time subproblem is given. Simulation results are used to study both the amount of compression achieved by the graph reduction techniques and their effects on heuristics for the problem. In addition, some modifications are made to existing heuristics to improve their performance. A probabilistic model is presented and compared with the simulations. | |
| 700 | 1 | |a Skeen, Dale |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007058779 | ||
Datensatz im Suchindex
| _version_ | 1804125056515702784 |
|---|---|
| any_adam_object | |
| author | Wright, David D. Skeen, Dale |
| author_facet | Wright, David D. Skeen, Dale |
| author_role | aut aut |
| author_sort | Wright, David D. |
| author_variant | d d w dd ddw d s ds |
| building | Verbundindex |
| bvnumber | BV010586477 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.D3 |
| callnumber-search | QA76.9.D3 |
| callnumber-sort | QA 276.9 D3 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)10796038 (DE-599)BVBBV010586477 |
| dewey-full | 001.642 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 001 - Knowledge |
| dewey-raw | 001.642 |
| dewey-search | 001.642 |
| dewey-sort | 11.642 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Allgemeines |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01635nam a2200289 c 4500</leader><controlfield tag="001">BV010586477</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960126s1983 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)10796038</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010586477</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-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.642</subfield><subfield code="2">19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wright, David D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Merging partitioned databases</subfield><subfield code="c">David D. Wright ; Dale Skeen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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="520" ind1="3" ind2=" "><subfield code="a">Partitioning of a distributed data base requires either that update activity be restricted or that a strategy for conflict resolution and partition merging be used once communication is restored. The graph-theoretic approach used by Davidson follows the latter approach and can be used to show that finding an optimum solution to the general problem is NP-complete. We give several methods of reducing the size of the graphs involved. Two open subproblems are shown to be NP-complete, while an extension of a known polynomial-time subproblem is given. Simulation results are used to study both the amount of compression achieved by the graph reduction techniques and their effects on heuristics for the problem. In addition, some modifications are made to existing heuristics to improve their performance. A probabilistic model is presented and compared with the simulations.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Skeen, Dale</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007058779</subfield></datafield></record></collection> |
| id | DE-604.BV010586477 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007058779 |
| oclc_num | 10796038 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 S. |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| record_format | marc |
| spelling | Wright, David D. Verfasser aut Merging partitioned databases David D. Wright ; Dale Skeen Ithaca, New York 1983 19 S. txt rdacontent n rdamedia nc rdacarrier Partitioning of a distributed data base requires either that update activity be restricted or that a strategy for conflict resolution and partition merging be used once communication is restored. The graph-theoretic approach used by Davidson follows the latter approach and can be used to show that finding an optimum solution to the general problem is NP-complete. We give several methods of reducing the size of the graphs involved. Two open subproblems are shown to be NP-complete, while an extension of a known polynomial-time subproblem is given. Simulation results are used to study both the amount of compression achieved by the graph reduction techniques and their effects on heuristics for the problem. In addition, some modifications are made to existing heuristics to improve their performance. A probabilistic model is presented and compared with the simulations. Skeen, Dale Verfasser aut |
| spellingShingle | Wright, David D. Skeen, Dale Merging partitioned databases |
| title | Merging partitioned databases |
| title_auth | Merging partitioned databases |
| title_exact_search | Merging partitioned databases |
| title_full | Merging partitioned databases David D. Wright ; Dale Skeen |
| title_fullStr | Merging partitioned databases David D. Wright ; Dale Skeen |
| title_full_unstemmed | Merging partitioned databases David D. Wright ; Dale Skeen |
| title_short | Merging partitioned databases |
| title_sort | merging partitioned databases |
| work_keys_str_mv | AT wrightdavidd mergingpartitioneddatabases AT skeendale mergingpartitioneddatabases |