FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2972029008> ?p ?o ?g. }

• W2972029008 endingPage "101736" @default.
• W2972029008 startingPage "101736" @default.
• W2972029008 abstract "Abstract Graphs, being an expressive data structure, have become increasingly important for modeling real-world applications, such as collaboration, different kinds of transactions, social networks, to name a few. With the advent of social networks and the web, the graph sizes have grown too large to fit in main memory precipitating the need for alternative approaches for an efficient, scalable evaluation of queries on graphs of any size. In this paper, we use the time-tested “divide and conquer” approach by partitioning a graph into desired number of partitions (and possibly with appropriate characteristics) and process queries over those partitions to obtain all or specified number of answers. This entails correctly computing answers that span multiple partitions or even need the same partition more than once. Given a set of partitions, there are a number of approaches using which a query can be evaluated: (i) One Partition At a Time (OPAT) approach, (ii) Traditional use of Multiple Processors (TraditionalMP), and (iii) using the Map/Reduce Multi-Processor approach (MapReduceMP) approach. The first approach, detailed in this paper, has established scalability through independent processing of partitions. The other two approaches address response time in addition to scalability. For the OPAT query evaluation approach, necessary minimal book keeping has been identified and its correctness established in this paper. Query answering on partitioned graphs also requires analyzing partitioning schemes for their impact on query processing and determining the number as well as the sequence in which partitions need to be loaded to reduce the response time for processing queries. We correlate query properties and partition characteristics to reduce query processing time in terms of the resources available. We also identify a set of quantitative metrics and use them for formulating heuristics to determine the order of loading partitions for efficient query processing. For OPAT approach, extensive experiments on large graphs (synthetic and real-world) using different partitioning schemes analyze the proposed heuristics on a variety of query types. The other two approaches are fleshed out, analyzed, and contrasted with the OPAT approach. An existing graph querying system has been extended to evaluate queries on partitioned graphs. Finally all three approaches are compared for their strengths and weaknesses." @default.
• W2972029008 created "2019-09-12" @default.
• W2972029008 creator A5001389234 @default.
• W2972029008 creator A5003568076 @default.
• W2972029008 creator A5024779652 @default.
• W2972029008 creator A5053181848 @default.
• W2972029008 date "2020-03-01" @default.
• W2972029008 modified "2023-09-25" @default.
• W2972029008 title "Query processing on large graphs: Approaches to scalability and response time trade offs" @default.
• W2972029008 cites W2020657191 @default.
• W2972029008 cites W2048653843 @default.
• W2972029008 cites W2101511590 @default.
• W2972029008 cites W2130822890 @default.
• W2972029008 cites W2147913014 @default.
• W2972029008 cites W2221436664 @default.
• W2972029008 cites W2405156126 @default.
• W2972029008 cites W2505546651 @default.
• W2972029008 cites W2520469311 @default.
• W2972029008 cites W2885247973 @default.
• W2972029008 doi "https://doi.org/10.1016/j.datak.2019.101736" @default.
• W2972029008 hasPublicationYear "2020" @default.
• W2972029008 type Work @default.
• W2972029008 sameAs 2972029008 @default.
• W2972029008 citedByCount "5" @default.
• W2972029008 countsByYear W29720290082020 @default.
• W2972029008 countsByYear W29720290082021 @default.
• W2972029008 countsByYear W29720290082022 @default.
• W2972029008 crossrefType "journal-article" @default.
• W2972029008 hasAuthorship W2972029008A5001389234 @default.
• W2972029008 hasAuthorship W2972029008A5003568076 @default.
• W2972029008 hasAuthorship W2972029008A5024779652 @default.
• W2972029008 hasAuthorship W2972029008A5053181848 @default.
• W2972029008 hasBestOaLocation W29720290082 @default.
• W2972029008 hasConcept C111919701 @default.
• W2972029008 hasConcept C120314980 @default.
• W2972029008 hasConcept C19012869 @default.
• W2972029008 hasConcept C41008148 @default.
• W2972029008 hasConcept C48044578 @default.
• W2972029008 hasConcept C77088390 @default.
• W2972029008 hasConceptScore W2972029008C111919701 @default.
• W2972029008 hasConceptScore W2972029008C120314980 @default.
• W2972029008 hasConceptScore W2972029008C19012869 @default.
• W2972029008 hasConceptScore W2972029008C41008148 @default.
• W2972029008 hasConceptScore W2972029008C48044578 @default.
• W2972029008 hasConceptScore W2972029008C77088390 @default.
• W2972029008 hasLocation W29720290081 @default.
• W2972029008 hasLocation W29720290082 @default.
• W2972029008 hasOpenAccess W2972029008 @default.
• W2972029008 hasPrimaryLocation W29720290081 @default.
• W2972029008 hasRelatedWork W1582490518 @default.
• W2972029008 hasRelatedWork W1588015694 @default.
• W2972029008 hasRelatedWork W1596201972 @default.
• W2972029008 hasRelatedWork W1767718647 @default.
• W2972029008 hasRelatedWork W1788737569 @default.
• W2972029008 hasRelatedWork W1986253068 @default.
• W2972029008 hasRelatedWork W2364921833 @default.
• W2972029008 hasRelatedWork W2380023786 @default.
• W2972029008 hasRelatedWork W2385146268 @default.
• W2972029008 hasRelatedWork W2546696010 @default.
• W2972029008 hasVolume "126" @default.
• W2972029008 isParatext "false" @default.
• W2972029008 isRetracted "false" @default.
• W2972029008 magId "2972029008" @default.
• W2972029008 workType "article" @default.