Formal methods for verification of websites macrostructure integrity
Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventoryi...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Kogalovsky, M. R. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2000 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© MAIK “Nauka/Interperiodica” 2000 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Programming and computer software - Nauka/Interperiodica, 1975, 26(2000), 4 vom: Juli, Seite 186-191 |
|---|---|
| Übergeordnetes Werk: |
volume:26 ; year:2000 ; number:4 ; month:07 ; pages:186-191 |
| Links: |
|---|
| DOI / URN: |
10.1007/BF02759467 |
|---|
| Katalog-ID: |
OLC2049260555 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2049260555 | ||
| 003 | DE-627 | ||
| 005 | 20230503234746.0 | ||
| 007 | tu | ||
| 008 | 200819s2000 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/BF02759467 |2 doi | |
| 035 | |a (DE-627)OLC2049260555 | ||
| 035 | |a (DE-He213)BF02759467-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 Kogalovsky, M. R. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Formal methods for verification of websites macrostructure integrity |
| 264 | 1 | |c 2000 | |
| 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 © MAIK “Nauka/Interperiodica” 2000 | ||
| 520 | |a Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. | ||
| 650 | 4 | |a Relational Algebra | |
| 650 | 4 | |a Navigation Path | |
| 650 | 4 | |a Target Resource | |
| 650 | 4 | |a Simple Link | |
| 650 | 4 | |a Outer Link | |
| 700 | 1 | |a Efimova, E. N. |4 aut | |
| 700 | 1 | |a Rybina, T. A. |4 aut | |
| 700 | 1 | |a Brakhin, V. B. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Programming and computer software |d Nauka/Interperiodica, 1975 |g 26(2000), 4 vom: Juli, Seite 186-191 |w (DE-627)129455997 |w (DE-600)199438-4 |w (DE-576)014819252 |x 0361-7688 |7 nnns |
| 773 | 1 | 8 | |g volume:26 |g year:2000 |g number:4 |g month:07 |g pages:186-191 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/BF02759467 |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_70 | ||
| 912 | |a GBV_ILN_4046 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 26 |j 2000 |e 4 |c 07 |h 186-191 | ||
| author_variant |
m r k mr mrk e n e en ene t a r ta tar v b b vb vbb |
|---|---|
| matchkey_str |
article:03617688:2000----::omlehdfreiiainfestsars |
| hierarchy_sort_str |
2000 |
| publishDate |
2000 |
| allfields |
10.1007/BF02759467 doi (DE-627)OLC2049260555 (DE-He213)BF02759467-p DE-627 ger DE-627 rakwb eng 004 VZ Kogalovsky, M. R. verfasserin aut Formal methods for verification of websites macrostructure integrity 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © MAIK “Nauka/Interperiodica” 2000 Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. Relational Algebra Navigation Path Target Resource Simple Link Outer Link Efimova, E. N. aut Rybina, T. A. aut Brakhin, V. B. aut Enthalten in Programming and computer software Nauka/Interperiodica, 1975 26(2000), 4 vom: Juli, Seite 186-191 (DE-627)129455997 (DE-600)199438-4 (DE-576)014819252 0361-7688 nnns volume:26 year:2000 number:4 month:07 pages:186-191 https://doi.org/10.1007/BF02759467 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4046 GBV_ILN_4307 GBV_ILN_4700 AR 26 2000 4 07 186-191 |
| spelling |
10.1007/BF02759467 doi (DE-627)OLC2049260555 (DE-He213)BF02759467-p DE-627 ger DE-627 rakwb eng 004 VZ Kogalovsky, M. R. verfasserin aut Formal methods for verification of websites macrostructure integrity 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © MAIK “Nauka/Interperiodica” 2000 Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. Relational Algebra Navigation Path Target Resource Simple Link Outer Link Efimova, E. N. aut Rybina, T. A. aut Brakhin, V. B. aut Enthalten in Programming and computer software Nauka/Interperiodica, 1975 26(2000), 4 vom: Juli, Seite 186-191 (DE-627)129455997 (DE-600)199438-4 (DE-576)014819252 0361-7688 nnns volume:26 year:2000 number:4 month:07 pages:186-191 https://doi.org/10.1007/BF02759467 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4046 GBV_ILN_4307 GBV_ILN_4700 AR 26 2000 4 07 186-191 |
| allfields_unstemmed |
10.1007/BF02759467 doi (DE-627)OLC2049260555 (DE-He213)BF02759467-p DE-627 ger DE-627 rakwb eng 004 VZ Kogalovsky, M. R. verfasserin aut Formal methods for verification of websites macrostructure integrity 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © MAIK “Nauka/Interperiodica” 2000 Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. Relational Algebra Navigation Path Target Resource Simple Link Outer Link Efimova, E. N. aut Rybina, T. A. aut Brakhin, V. B. aut Enthalten in Programming and computer software Nauka/Interperiodica, 1975 26(2000), 4 vom: Juli, Seite 186-191 (DE-627)129455997 (DE-600)199438-4 (DE-576)014819252 0361-7688 nnns volume:26 year:2000 number:4 month:07 pages:186-191 https://doi.org/10.1007/BF02759467 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4046 GBV_ILN_4307 GBV_ILN_4700 AR 26 2000 4 07 186-191 |
| allfieldsGer |
10.1007/BF02759467 doi (DE-627)OLC2049260555 (DE-He213)BF02759467-p DE-627 ger DE-627 rakwb eng 004 VZ Kogalovsky, M. R. verfasserin aut Formal methods for verification of websites macrostructure integrity 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © MAIK “Nauka/Interperiodica” 2000 Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. Relational Algebra Navigation Path Target Resource Simple Link Outer Link Efimova, E. N. aut Rybina, T. A. aut Brakhin, V. B. aut Enthalten in Programming and computer software Nauka/Interperiodica, 1975 26(2000), 4 vom: Juli, Seite 186-191 (DE-627)129455997 (DE-600)199438-4 (DE-576)014819252 0361-7688 nnns volume:26 year:2000 number:4 month:07 pages:186-191 https://doi.org/10.1007/BF02759467 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4046 GBV_ILN_4307 GBV_ILN_4700 AR 26 2000 4 07 186-191 |
| allfieldsSound |
10.1007/BF02759467 doi (DE-627)OLC2049260555 (DE-He213)BF02759467-p DE-627 ger DE-627 rakwb eng 004 VZ Kogalovsky, M. R. verfasserin aut Formal methods for verification of websites macrostructure integrity 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © MAIK “Nauka/Interperiodica” 2000 Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. Relational Algebra Navigation Path Target Resource Simple Link Outer Link Efimova, E. N. aut Rybina, T. A. aut Brakhin, V. B. aut Enthalten in Programming and computer software Nauka/Interperiodica, 1975 26(2000), 4 vom: Juli, Seite 186-191 (DE-627)129455997 (DE-600)199438-4 (DE-576)014819252 0361-7688 nnns volume:26 year:2000 number:4 month:07 pages:186-191 https://doi.org/10.1007/BF02759467 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4046 GBV_ILN_4307 GBV_ILN_4700 AR 26 2000 4 07 186-191 |
| language |
English |
| source |
Enthalten in Programming and computer software 26(2000), 4 vom: Juli, Seite 186-191 volume:26 year:2000 number:4 month:07 pages:186-191 |
| sourceStr |
Enthalten in Programming and computer software 26(2000), 4 vom: Juli, Seite 186-191 volume:26 year:2000 number:4 month:07 pages:186-191 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Relational Algebra Navigation Path Target Resource Simple Link Outer Link |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Programming and computer software |
| authorswithroles_txt_mv |
Kogalovsky, M. R. @@aut@@ Efimova, E. N. @@aut@@ Rybina, T. A. @@aut@@ Brakhin, V. B. @@aut@@ |
| publishDateDaySort_date |
2000-07-01T00:00:00Z |
| hierarchy_top_id |
129455997 |
| dewey-sort |
14 |
| id |
OLC2049260555 |
| 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">OLC2049260555</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503234746.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2000 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF02759467</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2049260555</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF02759467-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">Kogalovsky, M. R.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formal methods for verification of websites macrostructure integrity</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</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">© MAIK “Nauka/Interperiodica” 2000</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relational Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Navigation Path</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Target Resource</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simple Link</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Outer Link</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Efimova, E. N.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rybina, T. A.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brakhin, V. B.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Programming and computer software</subfield><subfield code="d">Nauka/Interperiodica, 1975</subfield><subfield code="g">26(2000), 4 vom: Juli, Seite 186-191</subfield><subfield code="w">(DE-627)129455997</subfield><subfield code="w">(DE-600)199438-4</subfield><subfield code="w">(DE-576)014819252</subfield><subfield code="x">0361-7688</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:26</subfield><subfield code="g">year:2000</subfield><subfield code="g">number:4</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:186-191</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF02759467</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">26</subfield><subfield code="j">2000</subfield><subfield code="e">4</subfield><subfield code="c">07</subfield><subfield code="h">186-191</subfield></datafield></record></collection>
|
| author |
Kogalovsky, M. R. |
| spellingShingle |
Kogalovsky, M. R. ddc 004 misc Relational Algebra misc Navigation Path misc Target Resource misc Simple Link misc Outer Link Formal methods for verification of websites macrostructure integrity |
| authorStr |
Kogalovsky, M. R. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129455997 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0361-7688 |
| topic_title |
004 VZ Formal methods for verification of websites macrostructure integrity Relational Algebra Navigation Path Target Resource Simple Link Outer Link |
| topic |
ddc 004 misc Relational Algebra misc Navigation Path misc Target Resource misc Simple Link misc Outer Link |
| topic_unstemmed |
ddc 004 misc Relational Algebra misc Navigation Path misc Target Resource misc Simple Link misc Outer Link |
| topic_browse |
ddc 004 misc Relational Algebra misc Navigation Path misc Target Resource misc Simple Link misc Outer Link |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Programming and computer software |
| hierarchy_parent_id |
129455997 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Programming and computer software |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129455997 (DE-600)199438-4 (DE-576)014819252 |
| title |
Formal methods for verification of websites macrostructure integrity |
| ctrlnum |
(DE-627)OLC2049260555 (DE-He213)BF02759467-p |
| title_full |
Formal methods for verification of websites macrostructure integrity |
| author_sort |
Kogalovsky, M. R. |
| journal |
Programming and computer software |
| journalStr |
Programming and computer software |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2000 |
| contenttype_str_mv |
txt |
| container_start_page |
186 |
| author_browse |
Kogalovsky, M. R. Efimova, E. N. Rybina, T. A. Brakhin, V. B. |
| container_volume |
26 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Kogalovsky, M. R. |
| doi_str_mv |
10.1007/BF02759467 |
| dewey-full |
004 |
| title_sort |
formal methods for verification of websites macrostructure integrity |
| title_auth |
Formal methods for verification of websites macrostructure integrity |
| abstract |
Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. © MAIK “Nauka/Interperiodica” 2000 |
| abstractGer |
Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. © MAIK “Nauka/Interperiodica” 2000 |
| abstract_unstemmed |
Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given. © MAIK “Nauka/Interperiodica” 2000 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4046 GBV_ILN_4307 GBV_ILN_4700 |
| container_issue |
4 |
| title_short |
Formal methods for verification of websites macrostructure integrity |
| url |
https://doi.org/10.1007/BF02759467 |
| remote_bool |
false |
| author2 |
Efimova, E. N. Rybina, T. A. Brakhin, V. B. |
| author2Str |
Efimova, E. N. Rybina, T. A. Brakhin, V. B. |
| ppnlink |
129455997 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/BF02759467 |
| up_date |
2024-07-03T22:05:22.311Z |
| _version_ |
1803597195316822016 |
| 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">OLC2049260555</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503234746.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2000 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF02759467</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2049260555</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF02759467-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">Kogalovsky, M. R.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formal methods for verification of websites macrostructure integrity</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</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">© MAIK “Nauka/Interperiodica” 2000</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The problem of verifying macrostructure of websites where information resources are represented by means of HTML is studied. The macrostructure of a website is understood as the structure of interrelations between its resources based on hyperlinks. The approach presented involves inventorying information resources of the site, partial syntactic analysis of its HTML-files, locating their hyperlinks, and, in so doing, reconstructing its macrostructure (the hyperlink graph of resources). The description of the site's macrostructure is placed into a relational database and is analyzed by formal methods based on relational algebra and graph theory in order to detect irrelevant (dangling) hyperlinks, resources to which no inner hyperlink points, as well as hypertext pages unattainable from the homepage of the site. In the paper, the prospects of this approach are discussed in relation to websites created with the help of XML technologies. A brief description of an implemented prototype of a verification system for HTML sites is given.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relational Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Navigation Path</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Target Resource</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simple Link</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Outer Link</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Efimova, E. N.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rybina, T. A.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brakhin, V. B.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Programming and computer software</subfield><subfield code="d">Nauka/Interperiodica, 1975</subfield><subfield code="g">26(2000), 4 vom: Juli, Seite 186-191</subfield><subfield code="w">(DE-627)129455997</subfield><subfield code="w">(DE-600)199438-4</subfield><subfield code="w">(DE-576)014819252</subfield><subfield code="x">0361-7688</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:26</subfield><subfield code="g">year:2000</subfield><subfield code="g">number:4</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:186-191</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF02759467</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">26</subfield><subfield code="j">2000</subfield><subfield code="e">4</subfield><subfield code="c">07</subfield><subfield code="h">186-191</subfield></datafield></record></collection>
|
| score |
7.4010277 |