乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T11:06:15Z","timestamp":1726484775774},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T00:00:00Z","timestamp":1521849600000},"content-version":"am","delay-in-days":266,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61472131","61272546"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1016\/j.is.2017.03.002","type":"journal-article","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T15:15:26Z","timestamp":1489850126000},"page":"19-35","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["Answering top-K query combined keywords and structural queries on RDF graphs"],"prefix":"10.1016","volume":"67","author":[{"given":"Peng","family":"Peng","sequence":"first","affiliation":[]},{"given":"Lei","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Qin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2017.03.002_bib0001","series-title":"WWW","first-page":"697","article-title":"Yago: a core of semantic knowledge","author":"Suchanek","year":"2007"},{"issue":"3","key":"10.1016\/j.is.2017.03.002_bib0002","doi-asserted-by":"crossref","DOI":"10.1145\/1567274.1567278","article-title":"Semantics and complexity of SPARQL","volume":"34","author":"P\u00e9rez","year":"2009","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.is.2017.03.002_bib0003","series-title":"SIGMOD","first-page":"673","article-title":"A pivotal prefix based filtering algorithm for string similarity search","author":"Deng","year":"2014"},{"issue":"3","key":"10.1016\/j.is.2017.03.002_bib0004","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1109\/TKDE.2007.48","article-title":"The google similarity distance","volume":"19","author":"Cilibrasi","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.is.2017.03.002_bib0005","series-title":"VLDB","article-title":"BANKS: browsing and keyword searching in relational databases","author":"Aditya","year":"2002"},{"key":"10.1016\/j.is.2017.03.002_bib0006","series-title":"VLDB","first-page":"505","article-title":"Bidirectional expansion for keyword search on graph databases","author":"Kacholia","year":"2005"},{"key":"10.1016\/j.is.2017.03.002_bib0007","series-title":"SIGMOD","first-page":"305","article-title":"Blinks: ranked keyword searches on graphs","author":"He","year":"2007"},{"key":"10.1016\/j.is.2017.03.002_bib0008","series-title":"ICDE","first-page":"836","article-title":"Finding top-k min-cost connected trees in databases","author":"Ding","year":"2007"},{"key":"10.1016\/j.is.2017.03.002_bib0009","series-title":"ICDE","first-page":"868","article-title":"Star: Steiner-tree approximation in relationship graphs","author":"Kasneci","year":"2009"},{"issue":"10","key":"10.1016\/j.is.2017.03.002_bib0010","first-page":"681","article-title":"Keyword search in graphs: finding r-cliques","volume":"4","author":"Kargar","year":"2011","journal-title":"PVLDB"},{"issue":"1","key":"10.1016\/j.is.2017.03.002_bib0011","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"},{"year":"1979","series-title":"Computers and Intractability : A Guide to the Theory of NP-Completeness.","author":"Garey","key":"10.1016\/j.is.2017.03.002_bib0012"},{"issue":"1","key":"10.1016\/j.is.2017.03.002_bib0013","first-page":"647","article-title":"RDF-3X: a RISC-style engine for RDF","volume":"1","author":"Neumann","year":"2008","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2017.03.002_bib0014","series-title":"ICDE","first-page":"215","article-title":"Prefixspan: mining sequential patterns by prefix-projected growth","author":"Pei","year":"2001"},{"key":"10.1016\/j.is.2017.03.002_bib0015","series-title":"SIGMOD","first-page":"335","article-title":"Graph indexing: a frequent structure-based approach","author":"Yan","year":"2004"},{"issue":"4","key":"10.1016\/j.is.2017.03.002_bib0016","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.websem.2011.08.002","article-title":"Lightweight integration of IR and DB for scalable hybrid search with integrated ranking support","volume":"9","author":"Wang","year":"2011","journal-title":"J. Web Semant."},{"key":"10.1016\/j.is.2017.03.002_bib0017","series-title":"EGC","first-page":"5","article-title":"Maintaining an online bibliographical database: the problem of data quality","author":"Ley","year":"2006"},{"issue":"3","key":"10.1016\/j.is.2017.03.002_bib0018","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.websem.2009.07.002","article-title":"DBpedia - a crystallization point for the web of data","volume":"7","author":"Bizer","year":"2009","journal-title":"J. Web Semant."},{"key":"10.1016\/j.is.2017.03.002_bib0019","series-title":"SIGIR","first-page":"41","article-title":"IR evaluation methods for retrieving highly relevant documents","author":"J\u00e4rvelin","year":"2000"},{"key":"10.1016\/j.is.2017.03.002_bib0020","series-title":"SIGIR","first-page":"11","article-title":"User performance versus precision measures for simple search tasks","author":"Turpin","year":"2006"},{"issue":"1","key":"10.1016\/j.is.2017.03.002_bib0021","first-page":"1008","article-title":"Hexastore: sextuple indexing for semantic web data management","volume":"1","author":"Weiss","year":"2008","journal-title":"PVLDB"},{"issue":"2","key":"10.1016\/j.is.2017.03.002_bib0022","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s00778-008-0125-y","article-title":"SW-Store: a vertically partitioned DBMS for semantic web data management","volume":"18","author":"Abadi","year":"2009","journal-title":"VLDB J."},{"issue":"1","key":"10.1016\/j.is.2017.03.002_bib0023","first-page":"256","article-title":"X-RDF-3X: fast querying, high update rates, and consistency for RDF databases","volume":"3","author":"Neumann","year":"2010","journal-title":"PVLDB"},{"issue":"8","key":"10.1016\/j.is.2017.03.002_bib0024","first-page":"482","article-title":"Gstore: answering SPARQL queries via subgraph matching","volume":"4","author":"Zou","year":"2011","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2017.03.002_bib0025","series-title":"SIGMOD","first-page":"121","article-title":"Building an efficient RDF store over a relational database","author":"Bornea","year":"2013"},{"key":"10.1016\/j.is.2017.03.002_bib0026","unstructured":"V. Ingalalli, D. Ienco, P. Poncelet, S. Villata, Querying RDF data using a multigraph-based approach (2016) 245\u2013256. 10.5441\/002\/edbt.2016.24."},{"issue":"10","key":"10.1016\/j.is.2017.03.002_bib0027","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","article-title":"A (sub)graph isomorphism algorithm for matching large graphs","volume":"26","author":"Cordella","year":"2004","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.is.2017.03.002_bib0028","series-title":"ESWC","first-page":"584","article-title":"Q2semantic: a lightweight keyword interface to semantic search","author":"Wang","year":"2008"},{"key":"10.1016\/j.is.2017.03.002_bib0029","series-title":"ICDE","first-page":"405","article-title":"Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data","author":"Tran","year":"2009"},{"key":"10.1016\/j.is.2017.03.002_bib0030","series-title":"ISWC","first-page":"193","article-title":"Effectively interpreting keyword queries on RDF databases with a rear view","author":"Fu","year":"2011"},{"key":"10.1016\/j.is.2017.03.002_bib0031","series-title":"WWW (Companion Volume)","first-page":"209","article-title":"Cosi: context-sensitive keyword query interpretation on RDF databases","author":"Fu","year":"2011"},{"issue":"11","key":"10.1016\/j.is.2017.03.002_bib0032","doi-asserted-by":"crossref","first-page":"2774","DOI":"10.1109\/TKDE.2014.2302294","article-title":"Scalable keyword search on large RDF data","volume":"26","author":"Le","year":"2014","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.is.2017.03.002_bib0033","series-title":"ADMA","first-page":"635","article-title":"Keyword graph: answering keyword search over large graphs","author":"Wang","year":"2012"},{"key":"10.1016\/j.is.2017.03.002_bib0034","series-title":"WISE","first-page":"199","article-title":"Diversifying the results of keyword queries on linked data","author":"Dass","year":"2016"},{"key":"10.1016\/j.is.2017.03.002_bib0035","series-title":"ICDM","first-page":"721","article-title":"gspan: graph-based substructure pattern mining","author":"Yan","year":"2002"},{"key":"10.1016\/j.is.2017.03.002_bib0036","series-title":"EDBT","first-page":"192","article-title":"Gaddi: distance index based subgraph matching in biological networks","author":"Zhang","year":"2009"},{"issue":"1","key":"10.1016\/j.is.2017.03.002_bib0037","first-page":"16","article-title":"Searching RDF graphs with sparql and keywords","volume":"33","author":"Elbassuoni","year":"2010","journal-title":"IEEE Data Eng. Bull."},{"key":"10.1016\/j.is.2017.03.002_bib0038","series-title":"SIGMOD","first-page":"423","article-title":"Expressive and flexible access to web-extracted data: a keyword-based structured query language","author":"Pound","year":"2010"},{"key":"10.1016\/j.is.2017.03.002_bib0039","series-title":"SIGIR","first-page":"125","article-title":"Combining inverted indices and structured search for ad-hoc object retrieval","author":"Tonon","year":"2012"},{"key":"10.1016\/j.is.2017.03.002_bib0040","series-title":"ESWC","first-page":"554","article-title":"Hybrid search: effectively combining keywords and semantic searches","author":"Bhagdev","year":"2008"},{"key":"10.1016\/j.is.2017.03.002_bib0041","series-title":"OTM Conferences","first-page":"921","article-title":"Integrating keywords and semantics on document annotation and search","author":"Bikakis","year":"2010"},{"key":"10.1016\/j.is.2017.03.002_bib0042","series-title":"SIGMOD","first-page":"313","article-title":"Natural language question answering over RDF: a graph data driven approach","author":"Zou","year":"2014"},{"key":"10.1016\/j.is.2017.03.002_bib0043","series-title":"SIGMOD","first-page":"1809","article-title":"How to build templates for RDF question\/answering: an uncertain graph similarity join approach","author":"Zheng","year":"2015"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030643791730042X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030643791730042X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T17:30:36Z","timestamp":1712424636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030643791730042X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":43,"alternative-id":["S030643791730042X"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2017.03.002","relation":{},"ISSN":["0306-4379"],"issn-type":[{"type":"print","value":"0306-4379"}],"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Answering top-K query combined keywords and structural queries on RDF graphs","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2017.03.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}