[1] |
〗DAVOUDIAN A, LIU M C. Big data systems: A software engineering perspective[J]. ACM Computing Surveys, 2020,53(5). DOI: 10.1145/3408314.
|
[2] |
SOKOLINSKY L B. Survey of architectures of parallel database systems[J]. Programming and Computer Software, 2004,30(6):337-346.
|
[3] |
ABADI D, AILAMAKI A, ANDERSEN D, et al. The Seattle report on database research[J]. ACM SIGMOD Record, 2020,48(4):44-53.
|
[4] |
ARRUDA D. Requirements engineering in the context of big data applications[J]. ACM SIGSOFT Software Engineering Notes, 2018,43(1). DOI: 10.1145/3178315.3178323.
|
[5] |
DAVOUDIAN A, CHEN L, LIU M C. A survey on NoSQL stores[J]. ACM Computing Surveys, 2018,51(2). DOI: 10.1145/3158661.
|
[6] |
胡婕,刘梦赤. 信息网模型INM研究[M]. 北京:科学出版社, 2011.〖HJ0.44mm〗
|
[7] |
徐倩,胡婕,刘梦赤. 复杂语义关系的描述与操作[J]. 计算机科学与探索, 2014,8(12):1432-1441.
|
[8] |
马杨,刘梦赤. 分布式信息网数据库管理系统的动态数据划分研究[J]. 计算机工程, 2017,43(9):34-38.
|
[9] |
杨小虎,王新宇,毛明. 基于数据划分的分布式模型及其负载均衡算法[J]. 浙江大学学报(工学版), 2008,42(4):602-607.
|
[10] |
KARYPIS G, KUMAR V. Multilevel graph partitioning schemes[C]// Proceedings of the 1995 International Conference on Parallel Processing. 1995:113-122.
|
[11] |
ARORA A, KAUR K. Enhanced multilevel hybrid algorithm for graph partitioning[J]. International Journal of Computer Applications, 2015,120(6):16-19.
|
[12] |
MOHAMMAD S, BRE S, SCHALLEHN E. Cloud data management: A short overview and comparison of current approaches[C]// Proceedings of the 2012 24th GI-Workshop on Foundations of Databases. 2012:41-46.
|
[13] |
CHEN C, TSAI K C. The server reassignment problem for load balancing in structured P2P systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2008,19(2):234-246.
|
[14] |
HAO F, YAU S S, MIN G Y, et al. Detecting k-balanced trusted cliques in signed social networks[J]. IEEE Internet Computing, 2014,18(2):24-31.
|
[15] |
ANDREEV K, RACKE H. Balanced graph partitioning[J]. Theory of Computing Systems, 2006,39(6):929-939.
|
[16] |
GUTTMANN-BECK N, HASSIN R. Approximation algorithms for minimum k-cut[J]. Algorithmica, 2000,27(2):198-207.
|
[17] |
NAGAMOCHI H, IBARAKI T. A fast algorithm for computing minimum 3-way and 4-way cuts[J]. Mathematical Programming, 2000,88(3):507-520.
|
[18] |
GUSFIELD D, TARDOS . A faster parametric minimum-cut algorithm[J]. Algorithmica, 1994,11(3):278-290.
|
[19] |
FIRTH H, MISSIER P. TAPER: Query-aware, partition-enhancement for large, heterogenous graphs[J]. Distributed and Parallel Databases, 2017,35(2):85-115.
|
[20] |
TURK A, SELVITOPI R O, FERHATOSMANOGLU H, et al. Temporal workload-aware replicated partitioning for social networks[J]. IEEE Transactions on Knowledge and Data Engineering, 2014,26(11):2832-2845.
|
[21] |
PENG P, ZOU L, CHEN L, et al. Adaptive distributed RDF graph fragmentation and allocation based on query workload[J]. IEEE Transactions on Knowledge and Data Engineering, 2019,31(4):670-685.
|
[22] |
DAVOUDIAN A, CHEN L, TU H W, et al. A workload-adaptive streaming partitioner for distributed graph stores[J]. Data Science and Engineering, 2021,6(2):163-179.
|
[23] |
XU N, CHEN L, CUI B. LogGP: A log-based dynamic graph partitioning method[J]. Proceedings of the VLDB Endowment, 2014,7(14):1917-1928.
|
[24] |
CODD E F. A relational model of data for large shared data banks[J]. Communications of the ACM, 1970,13(6):377-387.
|
[25] |
BERLER M, EASTMAN J, JORDAN D, et al. The Object Data Standard: ODMG 3.0[M]. Morgan Kaufmann, 2000.
|
[26] |
GOTTLOB G, SCHREFL M, ROCK B. Extending object-oriented systems with roles[J]. ACM Transactions on Information Systems, 1996,14(3):268-296.
|
[27] |
LASSILA O, SWICK R R. Resource Description Framework (RDF) Model and Syntax Specification[S]. World Wide Web Consortium, 1998.
|
[28] |
GAO L B, GOLAB L, OZSU M T, et al. Stream WatDiv: A streaming RDF benchmark[C]// Proceedings of the 2018 International Workshop on Semantic Big Data. 2018. DOI: 10.1145/3208352.3208355.
|