Top-K Query Processing in Edge-Labeled Graph Data
<p> 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 gr...
Main Author: | Park, Noseong |
---|---|
Language: | EN |
Published: |
University of Maryland, College Park
2016
|
Subjects: | |
Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=10128677 |
Similar Items
-
A Framework for Top-K Queries over Weighted RDF Graphs
Published: (2010) -
Query processing for graph-structured data.
Published: (2007) -
Dynamic Top-K Interesting Subgraph Query on Large-Scale Labeled Graphs
by: Xiaohuan Shan, et al.
Published: (2019-02-01) -
Querying Graph Structured Data
by: Yang, Lei
Published: (2015) -
Probabilistic Top-k Dominating Query Processing on Multiple Uncertain Data Streams in Edge Computing Environments
by: 范植承
Published: (2019)