乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T12:01:40Z","timestamp":1726920100932},"reference-count":31,"publisher":"Wiley","issue":"24","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2021,12,25]]},"abstract":"Abstract<\/jats:title>With the rapid growth of RDF (resource description framework) data volume, it is challenging to answer queries over dynamic RDF graphs of which the data frequently changes (by insertion\/deletion) over time. This article presents QRDF<\/jats:italic>, an efficient RDF graph processing system that supports not only efficient storage but also fast query of dynamic RDF graphs. QRDF (i) adopts a red\u2010black (RB) tree for quick RDF data insertion\/deletion and (ii) asynchronously moves data from the RB tree into a vector for efficient RDF query. QRDF performs early pruning on its index structure for various RDF query patterns. Experimental results show that the query performance of QRDF over RDF graphs is about 2x higher than that of the state\u2010of\u2010the\u2010art RDF processing systems.<\/jats:p>","DOI":"10.1002\/cpe.6441","type":"journal-article","created":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T07:21:50Z","timestamp":1626852110000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["QRDF: An efficient RDF graph processing system for fast query"],"prefix":"10.1002","volume":"33","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-5639-7882","authenticated-orcid":false,"given":"Menghan","family":"Jia","sequence":"first","affiliation":[{"name":"Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6450-8485","authenticated-orcid":false,"given":"Yiming","family":"Zhang","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China"}]},{"given":"Dongsheng","family":"Li","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China"}]}],"member":"311","published-online":{"date-parts":[[2021,7,21]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2019.9010061"},{"key":"e_1_2_10_3_1","doi-asserted-by":"publisher","DOI":"10.1631\/FITEE.1800363"},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.1631\/FITEE.1800260"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.26599\/BDMA.2019.9020006"},{"key":"e_1_2_10_6_1","doi-asserted-by":"crossref","unstructured":"WangY DuX LuJ WangX. Flextable: using a dynamic relation model to store RDF data. Paper presented at: Proceedings of the 15th International Conference on DASFAA;2010:580\u2010594; Springer\u2010verlag New York NY.","DOI":"10.1007\/978-3-642-12026-8_44"},{"key":"e_1_2_10_7_1","doi-asserted-by":"crossref","unstructured":"GoasdoueF ManolescuI RoatisA. Efficient query answering against dynamic RDF databases. Paper presented at: Proceedings of the 16th International Conference on Extending Database Technology. Genoa Italy;2013:299\u2010310.","DOI":"10.1145\/2452376.2452412"},{"key":"e_1_2_10_8_1","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2019.9010054"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002974.2002976"},{"key":"e_1_2_10_10_1","unstructured":"ShiJ YaoY ChenR ChenH LiF. Fast and concurrent RDF queries with rdma\u2010based distributed graph exploration. Paper presented at: Proceedings of the 12th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI}. SAVANNAH GA USA;2016:317\u2010332."},{"key":"e_1_2_10_11_1","unstructured":"WangS LouC ChenR ChenH. Fast and concurrent RDF queries using RDMA\u2010assisted GPU graph exploration. Paper presented at: 2018 {USENIX} Annual Technical Conference ({USENIX}{ATC} 18). Boston MA USA;2018:651\u2010664."},{"key":"e_1_2_10_12_1","unstructured":"Resource description framework (RDF). https:\/\/www.w3.org\/RDF."},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_2_10_14_1","unstructured":"SWAT Projects \u2010 the Lehigh University Benchmark (LUBM).http:\/\/swat.cse.lehigh.edu\/projects\/lubm\/."},{"key":"e_1_2_10_15_1","unstructured":"Waterloo SPARQL diversity test suite (WSDTS).https:\/\/dsg.uwaterloo.ca\/watdiv\/."},{"key":"e_1_2_10_16_1","doi-asserted-by":"crossref","unstructured":"AtreM ChaojiV ZakiMJ HendlerJA. Matrix \"bit\" loaded: a scalable lightweight join query processor for RDF data. Paper presented at: Proceedings of the 19th International Conference on World Wide Web. Raleigh North Carolina USA;2010:41\u201050.","DOI":"10.1145\/1772690.1772696"},{"key":"e_1_2_10_17_1","unstructured":"DBpedia SPARQL Benchmark.https:\/\/aksw.org\/Projects\/DBPSB.html."},{"key":"e_1_2_10_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453927"},{"key":"e_1_2_10_19_1","unstructured":"XieX WeiX ChenR ChenH. Pragh: locality\u2010preserving graph traversal with split live migration. Paper presented at: Proceedings of the 2019 USENIX Annual Technical Conference (USENIX ATC). Lenton Washington USA;2019:723\u2010738."},{"key":"e_1_2_10_20_1","unstructured":"WeiX ChenR ChenH. Fast RDMA\u2010based ordered key\u2010value store using remote learned cache. Paper presented at: Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation OSDI;2020:117\u2010135."},{"key":"e_1_2_10_21_1","doi-asserted-by":"crossref","unstructured":"YangK ZhangM ChenK MaX BaiY JiangY. Knightking: a fast distributed graph random walk engine. Paper presented at: Proceedings of the 27th ACM Symposium on Operating Systems Principles. Huntsville Ontario Canada;2019:524\u2010537.","DOI":"10.1145\/3341301.3359634"},{"key":"e_1_2_10_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536349.2536352"},{"key":"e_1_2_10_23_1","doi-asserted-by":"crossref","unstructured":"YangS YanX ZongB KhanA. Towards effective partition management for large graphs;2012:517\u2010528.","DOI":"10.1145\/2213836.2213895"},{"key":"e_1_2_10_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488333"},{"key":"e_1_2_10_25_1","unstructured":"Neo4j graph database.https:\/\/neo4j.com\/."},{"key":"e_1_2_10_26_1","doi-asserted-by":"crossref","unstructured":"IordanovB. Hypergraphdb: a generalized graph database;2010:25\u201036.","DOI":"10.1007\/978-3-642-16720-1_3"},{"issue":"2","key":"e_1_2_10_27_1","first-page":"385","article-title":"Sw\u2010store: a vertically partitioned dbms for semantic web data management","volume":"18","author":"Abadi DJ","year":"2009","journal-title":"Proc VLDB Endow"},{"key":"e_1_2_10_28_1","doi-asserted-by":"crossref","unstructured":"NeumannT WeikumG. Scalable join processing on very large RDF graphs. Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data;2009:627\u2010640.","DOI":"10.1145\/1559845.1559911"},{"key":"e_1_2_10_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453965"},{"key":"e_1_2_10_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815948.1815953"},{"key":"e_1_2_10_31_1","doi-asserted-by":"crossref","unstructured":"BorneaMA DolbyJ KementsietsidisA et al. Building an efficient RDF store over a relational database. Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data;2013:121\u2010132.","DOI":"10.1145\/2463676.2463718"},{"key":"e_1_2_10_32_1","doi-asserted-by":"crossref","unstructured":"ZhangY ChenR ChenH. Sub\u2010millisecond stateful stream querying over fast\u2010evolving linked data. Paper presented at: Proceedings of the 26th Symposium on Operating System Principles. Shanghai China;2017.","DOI":"10.1145\/3132747.3132777"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.6441","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/cpe.6441","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.6441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T08:57:15Z","timestamp":1693213035000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.6441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":31,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2021,12,25]]}},"alternative-id":["10.1002\/cpe.6441"],"URL":"https:\/\/doi.org\/10.1002\/cpe.6441","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2020-12-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-17","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}