3,434 Hits in 4.4 sec


Bin Shao, Haixun Wang, Yatao Li
2013 Proceedings of the 2013 international conference on Management of data - SIGMOD '13  
In this paper, we introduce Trinity, a general purpose graph engine over a distributed memory cloud.  ...  In particular, Trinity leverages graph access patterns in both online and offline computation to optimize memory and communication for best performance.  ...  CONCLUSION We introduce a graph engine called Trinity for building online query processing applications as well as offline graph analytics applications.  ... 
doi:10.1145/2463676.2467799 dblp:conf/sigmod/ShaoWL13 fatcat:rb2neflijnbitplwtbc2mnli3y

Distributed real-time knowledge graph serving

Liang He, Bin Shao, Yatao Li, Enhong Chen
2015 2015 International Conference on Big Data and Smart Computing (BIGCOMP)  
Due to the great connectedness, knowledge data by its very nature are complex entity graphs with rich schemata. The machineprocessable knowledge keeps its pace with the phenomenal "Big Data" era.  ...  On the one hand, we have a revolutionary way of piling knowledge up; on the other hand, the technology of making the knowledge graph accessible, i.e. how to serve the knowledge to support real-life applications  ...  The paper is organized as follows: Section II introduces how knowledge graphs are modeled and served on top of the Trinity graph engine.  ... 
doi:10.1109/35021bigcomp.2015.7072810 dblp:conf/bigcomp/HeSLC15 fatcat:dhhfscozb5h6za62ulgwaaxmle


Hongbin Ma, Bin Shao, Yanghua Xiao, Liang Jeff Chen, Haixun Wang
2016 Proceedings of the VLDB Endowment  
Specifically, G-SQL is a SQL dialect augmented with graph exploration functionalities and it dispatches query tasks to the in-memory graph engine and its underlying RDMBS.  ...  In this paper, we present G-SQL, our effort toward the integration of a RDBMS and a native in-memory graph processing engine.  ...  G-SQL's query processor assigns table-join graphs and graph patterns to the SQL engine and Trinity respectively.  ... 
doi:10.14778/2994509.2994510 fatcat:3t7jf3sdpnenjkhbomnljydhry

Trinity RNA-Seq assembler performance optimization

Robert Henschel, Phillip M. Nista, Matthias Lieber, Brian J. Haas, Le-Shin Wu, Richard D. LeDuc
2012 Proceedings of the 1st Conference of the Extreme Science and Engineering Discovery Environment on Bridging from the eXtreme to the campus and beyond - XSEDE '12  
In this paper we first conduct a performance study of Trinity and compare it to previously published data from 2011.  ...  We examine the runtime behavior of Trinity as a whole as well as its individual components and then optimize the most performance critical parts.  ...  QuantifyGraph consumes most of its time sorting the k-mers and then integrating the reads into the graph.  ... 
doi:10.1145/2335755.2335842 fatcat:x657dpxjpreqdgky3pmlj34azy

Stable multi-label boosting for image annotation with structural feature selection

YueTing Zhuang, YaHong Han, Fei Wu, JiaCheng Yang
2011 Science China Information Sciences  
Chu • Research on knowledge base, RDF and data mining Research on spatial database, spatial objects indexing and accessing • Research on machine learning and its application to multimedia content analysis  ...  Ross • Research on main-memory databases and database implementation on modern hardware Advisor: Senior Researcher Haixun Wang • Research on distributed graph database and RDF query engines Advisor: Distinguished  ... 
doi:10.1007/s11432-011-4483-5 fatcat:xoocx6alfjbftjxxg6c6wsmnfy

Page 675 of American Society of Civil Engineers. Proceedings of the American Society of Civil Engineers Vol. 69, Issue 5 [page]

1943 American Society of Civil Engineers. Proceedings of the American Society of Civil Engineers  
For this class a satisfactory technique is described in its application to the Trinity River basin in a succeeding section of this paper.  ...  It is understood that basic data have been obtained and that such techniques have been developed by the flood control technicians of the U. 8. Department of Agriculture.  ... 

Performance Optimization for the Trinity RNA-Seq Assembler [chapter]

Michael Wagner, Ben Fulton, Robert Henschel
2016 Tools for High Performance Computing 2015  
In this paper we share our efforts and experiences in analyzing and optimizing Trinity, a well-established framework for the de novo reconstruction of transcriptomes from RNA-seq reads.  ...  Performance analysis tools are designed to assist developers in this challenging task by helping to understand the application behavior and identify critical performance issues.  ...  In addition, it was necessary to break down the Trinity pipeline in a way allowing to monitor the components individually. Tracing results in massive data collection and application slowdown.  ... 
doi:10.1007/978-3-319-39589-0_3 fatcat:bugzctgomva5tf5bww3woa3au4

Exploration and Practice of Ideological and Political Theories Teaching in Operations Research Courses Based on the "Trinity"

Rong Liu
2021 Journal of Contemporary Educational Research  
teaching as its core, as well as discusses four methods of ideological and political theories teaching: online and offline interactive teaching, stimulating independent learning by practical application  ...  research courses based on "trinity" according to real teaching practices.  ...  Taking Guangzhou Maritime University as an example, it covers logistics management, logistics engineering, transportation, traffic management, marine engineering, navigation engineering, ship engineering  ... 
doi:10.26689/jcer.v5i11.2743 fatcat:kkhgchwl25elbieaifkzn47e54

Graph Management Systems: A Qualitative Survey

Maurizio Nolé, Carlo Sartiani
2020 APTIKOM Journal on Computer Science and Information Technologies  
In the recent years many real-world applications have been modeled by graph structures (e.g., social networks, mobile phone networks, web graphs, etc.), and many systems have been developed to manage,  ...  In this paper we provide an overview of several graph database systems and graph processing systems, with the aim of assisting the reader in identifying the best-suited solution for her application scenario  ...  Trinity Trinity is a general-purpose graph engine over a distributed memory cloud.  ... 
doi:10.34306/csit.v5i1.132 fatcat:wttmyaeuzvadpnrfrnawjvq46y

Unsupervised Technique for Web Data Extraction: Trinity

Sayali Khodade, Nilav Mukherjee
2015 International Journal of Computer Applications  
Search engine is a program which searches specific information from huge amount of data .So for getting results in an effective manner and within less time this technique is used.  ...  The technique does not provide any relevant data but searches for shared pattern and separates it into three sub parts then apply different ranking functions and stored it into database.  ...  FiVatechtakes more learning time comparatively trinity and roadrunner. All three graphs are for the comparison of three algorithms which are Trinity, RoadRunner and FiVaTech.  ... 
doi:10.5120/20263-2668 fatcat:zvbjgltfkvcwrkxhrozkqhwtsy

Athanasios Papoulis: Longtime professor and noted author [Obituary]

2002 IEEE Signal Processing Magazine  
Books by Papoulis The Fourier Integral and Its Applications.  ...  We wrap up this special issue with a article by Hero, Ma, Michel, and Gorman, who review the intriguing asymptotic theory of random graphs and use this theory to motivate minimal graph algorithms for pattern  ... 
doi:10.1109/msp.2002.1028347 fatcat:e6jxexuz6vdtpctzqrxskiiyqi

imGraph: A Distributed In-Memory Graph Database

Salim Jouili, Aldemar Reynaga
2013 2013 International Conference on Social Computing  
On top of it, we design and implement a traversal engine that achieves high performance by efficient memory access, distribution of the work load, and optimizations on network communications.  ...  Java APIs Core engine Traversal engine Graph data model Distributed Memory Storage Network communication  ...  ACKNOWLEDGMENT The authors would like to thank Eura Nova's staff for their support and encouragement that was very important for the writing of this paper.  ... 
doi:10.1109/socialcom.2013.109 dblp:conf/socialcom/JouiliR13 fatcat:y7zx3h3trrdnvmce3nk27hmkoy

Systems for big-graphs

Arijit Khan, Sameh Elnikety
2014 Proceedings of the VLDB Endowment  
However, the software and and hardware advances that have worked well for developing parallel databases and scientific applications are not necessarily effective for big-graph problems.  ...  In these cases, achieving low latency and high throughput requires partitioning the graph and processing the graph data in parallel across a cluster of servers.  ...  INTRODUCTION Querying and mining of graph data are essential for a wide range of emerging applications [4] .  ... 
doi:10.14778/2733004.2733067 fatcat:uiwftdvdtze5tjht6rb5hipdtq

The Impact of High-Performance Computing Best Practice Applied to Next-Generation Sequencing Workflows [article]

Pierre Carrier, Bill Long, Richard Walsh, Jef Dawson, Carlos P. Sosa, Brian Haas, Timothy Tickle, Thomas William
2015 bioRxiv   pre-print
We show that these types of applications can scale to thousands of cores.  ...  We will illustrate this point by showing results on the parallelization of the Inchworm module of the Trinity RNA-Seq pipeline for de novo transcriptome assembly.  ...  We thank Broad Institute principal investigator Aviv Regev for generously supporting Trinity development efforts and related activities.  ... 
doi:10.1101/017665 fatcat:2q4ztcuzlrbefiqfligmrjuvuy

Efficient Subgraph Matching on Billion Node Graphs [article]

Zhao Sun, Hongzhi Wang, Haixun Wang, Bin Shao, Jianzhong Li
2012 arXiv   pre-print
The ability to handle large scale graph data is crucial to an increasing number of applications.  ...  Instead of relying on super-linear indices, we use efficient graph exploration and massive parallel computing for query processing.  ...  INTRODUCTION Graphs serve as important data structures in many applications, including social network, web, and bioinformatics applications.  ... 
arXiv:1205.6691v1 fatcat:n3aicbbuajaqjppys6bz6xlf2m
« Previous Showing results 1 — 15 out of 3,434 results