| LDR | | 02031nam u200397 4500 |
| 001 | | 000000418668 |
| 005 | | 20190215163042 |
| 008 | | 181129s2018 |||||||||||||||||c||eng d |
| 020 | |
▼a 9780438371361 |
| 035 | |
▼a (MiAaPQ)AAI10845084 |
| 035 | |
▼a (MiAaPQ)purdue:23237 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 004 |
| 100 | 1 |
▼a Hassan, Mohamed S. |
| 245 | 10 |
▼a Native Graph Support in Relational Data Systems. |
| 260 | |
▼a [S.l.]:
▼b Purdue University.,
▼c 2018. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2018. |
| 300 | |
▼a 166 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 80-02(E), Section: B. |
| 500 | |
▼a Adviser: Walid G. Aref. |
| 502 | 1 |
▼a Thesis (Ph.D.)--Purdue University, 2018. |
| 520 | |
▼a A variety of data management applications spanning various domains, e.g., social networks, transportation, and bioinformatics, have graphs as first-class citizens. Specialized graph databases can serve these applications to evaluate vital graph- |
| 520 | |
▼a GRFusion is based on VoltDB, an open-source in-memory relational database. This dissertation shows how the SQL query engine of GRFusion is empowered to declaratively define graphs and execute cross-data-model query plans acting on graphs and rel |
| 520 | |
▼a To scale for large graphs and heavy query workloads, this dissertation presents Edge-Disjoint Partitioning (EDP) and Self-Balanced Graph Sketch (SBG-Sketch). EDP is a new technique for efficiently answering shortest-path queries with filtering p |
| 590 | |
▼a School code: 0183. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a Purdue University.
▼b Computer Sciences. |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 80-02B(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0183 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15000038
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a ***1012033 |