A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Loom: Query-aware Partitioning of Online Graphs
[article]
2017
arXiv
pre-print
Preserved Fulltext
Finally we attempt to allocate each match to single partitions, reducing the number of inter-partition edges within frequently traversed sub-graphs and improving average query performance. ...
First we capture the most common patterns of edge traversals which occur when executing queries. ...
INTRODUCTION Subgraph pattern matching is a class of operation fundamental to many "real-time" applications of graph data. For example, in social networks [9] , and network security [3] . ...
arXiv:1711.06608v1
fatcat:k2x5pyje6bd7zeikoxtfwyg4sy
Workload-aware Streaming Graph Partitioning
2016
International Conference on Extending Database Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
When the graph-stream being partitioned contains a match for a motif, LOOM uses graph-stream pattern matching to capture it, and place it wholly within partition boundaries. ...
We present our progress on LOOM: a streaming graph partitioner based upon efficient existing heuristics, which reduces inter-partition traversals when executing a stream of sub-graph pattern matching queries ...
for the edge traversals patterns of a given "online" workload of sub-graph pattern matching queries. ...
dblp:conf/edbt/FirthM16
fatcat:z2bve52fnzcuzdhcxhvirwelay
A Workload-Adaptive Streaming Partitioner for Distributed Graph Stores
2021
Data Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
partitioners, especially in dynamic query workloads. ...
We address these issues by proposing a novel workload-adaptive streaming partitioner named WASP, that aims to achieve low-latency and high-throughput online graph queries. ...
Online graph queries can be classified into two major types, namely path queries and pattern matching queries [11] . ...
doi:10.1007/s41019-021-00156-2
fatcat:6eajdxuz3ra7lo3rvqhbse5eyy
Lachesis: Automatic Partitioning for UDF-Centric Analytics
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2006.16529v4 fatcat:bwgko3dfyvfurgedpziuf37j6iOther Versions
partitionings compared to relational applications. ...
However it remains a significant challenge to automate this process for Big Data analytics workloads that extensively use user defined functions (UDFs), where sub-computations are hard to be reused for ...
The third one is an IR matching functionality based on Alg. 4 that is often used in query optimization, for determining whether the partitioner of the input datasets matches the desired partitioner of ...
arXiv:2006.16529v5
fatcat:nmxk56uzd5h4lajad6for6chry
TAPER: query-aware, partition-enhancement for large, heterogenous graphs
2017
Distributed and parallel databases
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A partitioning, however, may introduce extra query processing latency unless it is sensitive to a specific query workload, and optimised to minimise inter-partition traversals for that workload. ...
We evaluate TAPER on two different large test graphs and over realistic query workloads. ...
However, this assumption does not hold for general graph path and pattern matching queries. ...
doi:10.1007/s10619-017-7196-y
fatcat:5es24cr535dztbvyhxwvf47zoy
TAPER: query-aware, partition-enhancement for large, heterogenous, graphs
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
a given pattern matching queries workload. ...
A partitioning, however, may introduce extra query processing latency unless it is sensitive to a specific query workload, and optimised to minimise inter-partition traversals for that workload. ...
INTRODUCTION Pattern matching queries over labelled graphs are increasingly common in many applications. ...
arXiv:1603.04626v2
fatcat:7ucb4mksubevtjy27nnpbshyhu
New challenges in dynamic load balancing
2005
Applied Numerical Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Increased use of heterogeneous computing architectures requires partitioners that account for non-uniform computing, network, and memory resources. ...
And, for greatest impact, these new capabilities must be delivered in toolkits that are robust, easy-to-use, and applicable to a wide range of applications. ...
Zoltan also does not require applications to build specific data structures (e.g., graphs) for Zoltan. Instead, applications provide only simple functions to answer queries from Zoltan. ...
doi:10.1016/j.apnum.2004.08.028
fatcat:papkwaxblzcqdi6ove7lwe46ve
Hyper dimension shuffle
2019
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We demonstrate how it avoids the shuffling graph blowup of previous algorithms to shuffle at petabyte-scale efficiently on both synthetic benchmarks and real applications. PVLDB Reference Format: ...
Hyper Dimension Shuffle is inspired by the divide and conquer concept, and utilizes a recursive partitioner with intermediate aggregations. ...
We observe a linear pattern for the SCOPE+HD jobs, with the cost dominated by data transfer. ...
doi:10.14778/3339490.3339495
fatcat:6mlfzfclebcztlkcbivvqqf5o4
GSmart: An Efficient SPARQL Query Engine Using Sparse Matrix Algebra – Full Version
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
and the tree-based representation for evaluation results; (4) a multi-stage data partitioner to map the incident edge-based query evaluation into heterogeneous HPC architectures and develop multi-level ...
that determines the order in which vertices in query graphs should be evaluated; (3) memory- and computation-efficient data structures including the light-weight sparse matrix (LSpM) storage for RDF data ...
The graph approaches convert SPARQL queries to a query graph, as shown in Figure 2 , and evaluate queries by subgraph matching over the RDF graph (e.g., [2, 40, 47, 48] ). ...
arXiv:2106.14038v1
fatcat:2gogaelsxberbpbxv3kie2lacq
Q100
2014
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems - ASPLOS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose Database Processing Units, or DPUs, a class of domain-specific database processors that can efficiently handle database applications. ...
This work explores a Q100 design space of 150 configurations, selecting three for further analysis: a small, power-conscious implementation, a highperformance implementation, and a balanced design that ...
The authors also wish to thank Yunsung Kim, Stephen Edwards, and the anonymous reviewers for their time and feedback. ...
doi:10.1145/2541940.2541961
dblp:conf/asplos/WuLPKR14
fatcat:din6wqa36vembba2eunalxz6ma
Jet: Multilevel Graph Partitioning on Graphics Processing Units
[article]
2024
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2024; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2023 pre-print arXiv:2304.13194v1 fatcat:bvc2lr6cxbdf5nr3yvaay3wtda
We combine Jet with GPU-aware coarsening to develop a k-way graph partitioner, the Jet partitioner. ...
The new partitioner achieves superior quality compared to state-of-the-art shared memory partitioners on a large collection of test graphs. ...
., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA-0003525. ...
arXiv:2304.13194v2
fatcat:uzxo4nzipbg4hb3rhzwqsomucm
An Association-Oriented Partitioning Approach for Streaming Graph Query
2017
Scientific Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Regarding graph query, a well-designed partitioning method is essential for achieving better performance. ...
The volumes of real-world graphs like knowledge graph are increasing rapidly, which makes streaming graph processing a hot research area. ...
However, graph query, unlike PageRank, is a subgraph patter matching problem. Its performance is more related to the distribution of subgraphs in each partition. ...
doi:10.1155/2017/2573592
fatcat:23jwibpzvbe27dsnx2p3lc6xuu
Design of a scalable InfiniBand topology service to enable network-topology-aware placement of processes
2012
2012 International Conference for High Performance Computing, Networking, Storage and Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Over the last decade, InfiniBand has become an increasingly popular interconnect for deploying modern supercomputing systems. ...
Micro-benchmark level evaluations show that the proposed network-topology-aware MPI library can improve the latency for all message sizes by up to 40%. ...
The MPI library relies on external graph partitioners to map the communication pattern of the application to the topology of the underlying network. We use both Jostle and ParMETIS for this. ...
doi:10.1109/sc.2012.47
dblp:conf/sc/SubramoniPKBVKTSMP12
fatcat:dd5mkhn4drdyrjsht7ti4ka7ne
Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing
2012
Symposium on Networked Systems Design and Implementation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
However, we show that RDDs are expressive enough to capture a wide class of computations, including recent specialized programming models for iterative jobs, such as Pregel, and new applications that these ...
We have implemented RDDs in a system called Spark, which we evaluate through a variety of user applications and benchmarks. ...
Acknowledgements We thank the first Spark users, including Tim Hunter, Lester Mackey, Dilip Joseph, and Jibin Zhan, for trying out our system in their real applications, providing many good suggestions ...
dblp:conf/nsdi/ZahariaCDDMMFSS12
fatcat:jrhtufgxwncnhdilcbsfdjidku
A Unified Peer-to-Peer Database Framework for Scalable Service and Resource Discovery
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we devise the Unified Peer-to-Peer Database Framework (UPDF), which allows to express specific applications for arbitrary query languages (e.g. ...
It appears that a Peer-to-Peer (P2P) database network may be well suited to support dynamic distributed database search, for example for service discovery. ...
Existing P2P systems are built for a single application and data type and do not support queries from a general-purpose query language. ...
doi:10.1007/3-540-36133-2_12
fatcat:5hlldamrnvagjml6nmvhn6sng4
« Previous
Showing results 1 — 15 out of 258 results