東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Top-K Query Processing in Edge-Label...

Park, Noseong.

FindBook

Google Book

Amazon

博客來

Top-K Query Processing in Edge-Labeled Graph Data.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Top-K Query Processing in Edge-Labeled Graph Data./
作者:	Park, Noseong.
面頁冊數:	141 p.
附註:	Source: Dissertation Abstracts International, Volume: 77-10(E), Section: B.
Contained By:	Dissertation Abstracts International77-10B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10128677
ISBN:	9781339866789

Top-K Query Processing in Edge-Labeled Graph Data.
Park, Noseong.

Top-K Query Processing in Edge-Labeled Graph Data. - 141 p.

Source: Dissertation Abstracts International, Volume: 77-10(E), Section: B.

Thesis (Ph.D.)--University of Maryland, College Park, 2016.

Edge-labeled graphs have proliferated rapidly over the last decade due to the increased popularity of social networks and the Semantic Web. In social networks, relationships between people are represented by edges and each edge is labeled with a semantic annotation. Hence, a huge single graph can express many different relationships between entities. The Semantic Web represents each single fragment of knowledge as a triple (subject, predicate, object), which is conceptually identical to an edge from subject to object labeled with predicates. A set of triples constitutes an edge-labeled graph on which knowledge inference is performed.

ISBN: 9781339866789Subjects--Topical Terms:

523869
Computer science.

Top-K Query Processing in Edge-Labeled Graph Data.
LDR:04454nmm a2200325 4500 001 2077298
005 20161114130249.5
008 170521s2016 ||||||||||||||||| ||eng d
020 $a 9781339866789
035 $a (MiAaPQ)AAI10128677
035 $a AAI10128677
040 $a MiAaPQ $c MiAaPQ
100 1 $a Park, Noseong. $3 3192798
245 1 0 $a Top-K Query Processing in Edge-Labeled Graph Data.
300 $a 141 p.
500 $a Source: Dissertation Abstracts International, Volume: 77-10(E), Section: B.
500 $a Adviser: VS Subrahmanian.
502 $a Thesis (Ph.D.)--University of Maryland, College Park, 2016.
520 $a Edge-labeled graphs have proliferated rapidly over the last decade due to the increased popularity of social networks and the Semantic Web. In social networks, relationships between people are represented by edges and each edge is labeled with a semantic annotation. Hence, a huge single graph can express many different relationships between entities. The Semantic Web represents each single fragment of knowledge as a triple (subject, predicate, object), which is conceptually identical to an edge from subject to object labeled with predicates. A set of triples constitutes an edge-labeled graph on which knowledge inference is performed.
520 $a Subgraph matching has been extensively used as a query language for patterns in the context of edge-labeled graphs. For example, in social networks, users can specify a subgraph matching query to find all people that have certain neighborhood relationships. Heavily used fragments of the SPARQL query language for the Semantic Web and graph queries of other graph DBMS can also be viewed as subgraph matching over large graphs.
520 $a Though subgraph matching has been extensively studied as a query paradigm in the Semantic Web and in social networks, a user can get a large number of answers in response to a query. These answers can be shown to the user in accordance with an importance ranking. In this thesis proposal, we present four different scoring models along with scalable algorithms to find the top-k answers via a suite of intelligent pruning techniques. The suggested models consist of a practically important subset of the SPARQL query language augmented with some additional useful features.
520 $a The first model called Substitution Importance Query (SIQ) identifies the top-k answers whose scores are calculated from matched vertices' properties in each answer in accordance with a user-specified notion of importance. The second model called Vertex Importance Query (VIQ) identifies important vertices in accordance with a user-defined scoring method that builds on top of various subgraphs articulated by the user. Approximate Importance Query (AIQ), our third model, allows partial and inexact matchings and returns top-k of them with a user-specified approximation terms and scoring functions. In the fourth model called Probabilistic Importance Query (PIQ), a query consists of several sub-blocks: one mandatory block that must be mapped and other blocks that can be opportunistically mapped. The probability is calculated from various aspects of answers such as the number of mapped blocks, vertices' properties in each block and so on and the most top-k probable answers are returned.
520 $a An important distinguishing feature of our work is that we allow the user a huge amount of freedom in specifying: (i) what pattern and approximation he considers important, (ii) how to score answers - irrespective of whether they are vertices or substitution, and (iii) how to combine and aggregate scores generated by multiple patterns and/or multiple substitutions. Because so much power is given to the user, indexing is more challenging than in situations where additional restrictions are imposed on the queries the user can ask.
520 $a The proposed algorithms for the first model can also be used for answering SPARQL queries with ORDER BY and LIMIT, and the method for the second model also works for SPARQL queries with GROUP BY, ORDER BY and LIMIT. We test our algorithms on multiple real-world graph databases, showing that our algorithms are far more efficient than popular triple stores.
590 $a School code: 0117.
650 4 $a Computer science. $3 523869
690 $a 0984
710 2 $a University of Maryland, College Park. $b Computer Science. $3 1018451
773 0 $t Dissertation Abstracts International $g 77-10B(E).
790 $a 0117
791 $a Ph.D.
792 $a 2016
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10128677