|
|
|
|
| LEADER |
00000cam a2200000Ii 4500 |
| 001 |
EBSCO_ocn949929929 |
| 003 |
OCoLC |
| 005 |
20231017213018.0 |
| 006 |
m o d |
| 007 |
cr cnu|||unuuu |
| 008 |
160519s2016 xx o 000 0 eng d |
| 040 |
|
|
|a N$T
|b eng
|e rda
|e pn
|c N$T
|d IDEBK
|d IOSPR
|d EBLCP
|d BTCTA
|d OCLCF
|d N$T
|d YDXCP
|d IDB
|d VGM
|d OCLCQ
|d MERUC
|d OCLCQ
|d WAU
|d SNK
|d DKU
|d IGB
|d D6H
|d VTS
|d AGLDB
|d OCLCQ
|d WYU
|d G3B
|d S8J
|d S9I
|d STF
|d M8D
|d OCLCQ
|d VLY
|d OCLCA
|d OCLCO
|d OCLCQ
|d OCLCO
|
| 019 |
|
|
|a 950055580
|
| 020 |
|
|
|a 9781614996316
|q (electronic bk.)
|
| 020 |
|
|
|a 1614996318
|q (electronic bk.)
|
| 020 |
|
|
|z 9781614996309
|q (print)
|
| 029 |
1 |
|
|a AU@
|b 000062399112
|
| 035 |
|
|
|a (OCoLC)949929929
|z (OCoLC)950055580
|
| 050 |
|
4 |
|a QA76.625
|
| 072 |
|
7 |
|a COM
|x 021000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.74
|2 23
|
| 049 |
|
|
|a UAMI
|
| 100 |
1 |
|
|a Hartig, Olaf,
|e author.
|
| 245 |
1 |
0 |
|a Querying a web of linked data :
|b foundations and query execution /
|c Olaf Hartig.
|
| 264 |
|
1 |
|a [Place of publication not identified] :
|b IOS Press,
|c 2016.
|
| 300 |
|
|
|a 1 online resource
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Studies on the semantic web ;
|v vol. 024
|
| 588 |
0 |
|
|a Online resource; title from PDF title page (IOS Press, viewed May 31, 2016).
|
| 505 |
0 |
|
|a Title Page; Abstract; Contents; 1. Introduction; 1.1. Linked Data on the WWW; 1.2. Approaches to Query Linked Data; 1.3. Problem Statement; 1.4. Contributions; 1.5. Thesis Outline; I. Foundations of Queries over a Web of Linked Data; 2. Models for Linked Data Queries; 2.1. Data Model; 2.1.1. Structural Elements; 2.1.2. Queries; 2.1.3. Related Work; 2.2. Computation Model; 2.2.1. Existing Models of Computation on the WWW; 2.2.2. The LD Machine; 2.2.3. LD Machine Computability; 2.2.4. LD Machine Decidability; 3. Full-Web Query Semantics; 3.1. Related Work; 3.1.1. Web Query Languages
|
| 505 |
8 |
|
|a 3.1.2. Navigational Query Languages for Linked Data3.1.3. SPARQL as a Query Language for Linked Data; 3.2. Definition; 3.2.1. SPARQL; 3.2.2. SPARQLLD; 3.3. Theoretical Properties; 3.3.1. Satisfiability, (Un)bounded Satisfiability, and Monotonicity; 3.3.2. LD Machine Decidability of Termination; 3.3.3. LD Machine Computability; 3.3.4. Finiteness of Expected Query Results; 3.4. Summary; 4. Reachability-Based Query Semantics; 4.1. Definition; 4.1.1. Reachability; 4.1.2. SPARQLLD(R); 4.2. Result Containment and Infiniteness; 4.3. Reachability Criteria; 4.3.1. Comparing Reachability Criteria
|
| 505 |
8 |
|
|a 4.3.2. Combining Reachability Criteria4.3.3. Reachability Criteria that Ensure Finiteness; 4.3.4. Constant Reachability Criteria; 4.4. Theoretical Properties; 4.4.1. Satisfiability, (Un)bounded Satisfiability, and Monotonicity; 4.4.2. LD Machine Decidability of Termination; 4.4.3. LD Machine Computability; 4.5. Differences between SPARQLLD and SPARQLLD(R); II. Execution of Queries over a Web of Linked Data; 5. Overview of Query Execution Techniques; 5.1. Data Source Selection; 5.1.1. Live Exploration Approaches; 5.1.2. Index-Based Approaches; 5.1.3. Hybrid Approaches; 5.2. Data Source Ranking
|
| 505 |
8 |
|
|a 5.3. Integration of Data Retrieval and Result Construction5.3.1. Separated Execution Approaches; 5.3.2. Integrated Execution Approaches; 5.4. Traversal-Based Query Execution; 5.5. Summary; 6. A Traversal-Based Strategy; 6.1. Conjunctive Linked Data Queries; 6.2. Informal Description; 6.3. Query Execution Model; 6.3.1. Overview; 6.3.2. Partial Solutions; 6.3.3. Constructing (Partial) Solutions; 6.3.4. Discovered Subwebs of the Queried Web; 6.3.5. Traversing Data Links; 6.3.6. Combining Construction and Traversal; 6.3.7. Abstract Query Execution Procedure; 6.4. Soundness and Completeness
|
| 505 |
8 |
|
|a 6.5. Summary7. An Iterator-Based Implementation; 7.1. Definition; 7.1.1. Iterators for Query Execution over RDF Data; 7.1.2. Iterators for Traversal-Based Query Execution; 7.2. Formal Analysis; 7.2.1. Examples for Incompleteness; 7.2.2. Alignment with the Execution Model; 7.3. Experimental Analysis; 7.3.1. Our Query Execution System; 7.3.2. WWW-Based Experiment; 7.3.3. Simulation Based Experiments; 7.4. Summary; III. Conclusions; 8. Conclusions; 8.1. Main Results; 8.2. Directions for Future Work; 8.2.1. Schema Heterogeneity; 8.2.2. Coreferences; 8.2.3. Trustworthiness and Data Quality
|
| 590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
| 650 |
|
0 |
|a Querying (Computer science)
|v Congresses.
|
| 650 |
|
0 |
|a Linked data
|v Congresses.
|
| 650 |
|
6 |
|a Bases de données
|x Interrogation
|v Congrès.
|
| 650 |
|
6 |
|a Données liées
|v Congrès.
|
| 650 |
|
7 |
|a COMPUTERS
|x Databases
|x General.
|2 bisacsh
|
| 650 |
|
7 |
|a Linked data
|2 fast
|
| 650 |
|
7 |
|a Querying (Computer science)
|2 fast
|
| 655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|
| 830 |
|
0 |
|a Studies on the Semantic Web ;
|v v. 024.
|
| 856 |
4 |
0 |
|u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1238931
|z Texto completo
|
| 938 |
|
|
|a Baker and Taylor
|b BTCP
|n BK0018922975
|
| 938 |
|
|
|a EBL - Ebook Library
|b EBLB
|n EBL4528956
|
| 938 |
|
|
|a EBSCOhost
|b EBSC
|n 1238931
|
| 938 |
|
|
|a ProQuest MyiLibrary Digital eBook Collection
|b IDEB
|n cis34603145
|
| 938 |
|
|
|a YBP Library Services
|b YANK
|n 12996593
|
| 994 |
|
|
|a 92
|b IZTAP
|
