{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T20:30:52Z","timestamp":1778531452311,"version":"3.51.4"},"reference-count":22,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2024,11,15]]},"abstract":"<jats:p>The Resource Description Framework (RDF) is a framework for expressing information about resources in the form of triples (subject, predicate, object). The information represented by the standard RDF is static, i.e., that does not change over time. To better deal with a large amount of time-related information, temporal RDF is proposed. Consequently, how to explore index technology to efficiently query temporal information has become an important research issue, but the research on the index of temporal RDF is still short, especially the index of bitemporal RDF. BitemporalRDF can represent more complicated situations (e.g., RDF triples with both validtime and transactiontime). Indexes for bitemporal RDF can further expand the application scenarios and functions of temporal RDF. In this paper, we propose an efficient index for bitemporal RDF queries. The index innovatively introduces and re-designs skip list structure into the bitemporal RDF query. We also investigate how to cover almost all query patterns with as few indexes as possible. In addition, although the proposed index is conceived for temporal RDF, it also takes into account the performance of standard RDF queries when the time element is unknown. Finally, we run experiments with synthetic data sets of different sizes using the Lehigh University Benchmark (LUBM), and results prove that the proposed index is scalable and effective.<\/jats:p>","DOI":"10.3233\/ida-230609","type":"journal-article","created":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T10:33:56Z","timestamp":1707474836000},"page":"1579-1599","source":"Crossref","is-referenced-by-count":2,"title":["A bitemporal RDF index based on skip list"],"prefix":"10.1177","volume":"28","author":[{"given":"Fu","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, North Minzu University, Yinchuan, Ningxia, China"},{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-230609_ref1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/DCC47342.2020.00020","article-title":"Revisiting compact RDF stores based on K2-trees","author":"Brisaboa","year":"2020","journal-title":"2020 Data Compression Conference"},{"issue":"2","key":"10.3233\/IDA-230609_ref3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TKDE.2007.34","article-title":"Introducing time into RDF","volume":"19","author":"Gutierrez","year":"2007","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"9","key":"10.3233\/IDA-230609_ref4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.14569\/IJACSA.2012.030904","article-title":"A survey on models and query languages for temporally annotated RDF","volume":"3","author":"Analyti","year":"2012","journal-title":"International Journal of Advanced Computer Science and Applications"},{"key":"10.3233\/IDA-230609_ref5","first-page":"93","article-title":"Berlin","author":"Gutierrez","year":"2005","journal-title":"The Semantic Web: Research and Applications, ESWC 2005"},{"key":"10.3233\/IDA-230609_ref6","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s12145-021-00574-w","article-title":"RDF for temporal data management\u00a0\u2013 a survey","volume":"14","author":"Zhang","year":"2021","journal-title":"Earth Science Informatics"},{"key":"10.3233\/IDA-230609_ref7","first-page":"51","article-title":"Temporal data management\u00a0\u2013 an overview","author":"B\u00f6hlen","year":"2018","journal-title":"Business Intelligence and Big Data, eBISS 2017"},{"key":"10.3233\/IDA-230609_ref8","unstructured":"J. Bellamy-McIntyre, LSPARQL: Transaction Time Queries in RDF, The University of Auckland, (2020)."},{"key":"10.3233\/IDA-230609_ref9","unstructured":"L. Meijer, Bi-VAKs: Bi-temporal Versioning Approach for Knowledge Graphs, Delft University of Technology, (2022)."},{"issue":"1","key":"10.3233\/IDA-230609_ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10844-017-0480-5","article-title":"Modeling and querying temporal RDF knowledge graphs with relational databases","volume":"61","author":"Ma","year":"2023","journal-title":"Journal of Intelligent Information Systems"},{"key":"10.3233\/IDA-230609_ref11","unstructured":"D. Wu, BiTRDF: Extending Rdf for Bitemporal Data, City University of New York, (2022)."},{"key":"10.3233\/IDA-230609_ref12","first-page":"1465","article-title":"GRIN: a graph based RDF index","author":"Udrea","year":"2007","journal-title":"AAAI Conference on Artificial Intelligence"},{"issue":"6","key":"10.3233\/IDA-230609_ref13","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","article-title":"Skip lists: a probabilistic alternative to balanced trees","volume":"33","author":"Pugh","year":"1990","journal-title":"Communications of the ACM"},{"key":"10.3233\/IDA-230609_ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00778-021-00711-3","article-title":"A survey of RDF stores & sparql engines for querying knowledge graphs","volume":"31","author":"Ali","year":"2022","journal-title":"VLDB"},{"issue":"1","key":"10.3233\/IDA-230609_ref15","doi-asserted-by":"crossref","first-page":"647","DOI":"10.14778\/1453856.1453927","article-title":"RDF-3X: a risc-style engine for RDF","volume":"1","author":"Neumann","year":"2008","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10.3233\/IDA-230609_ref16","first-page":"470","article-title":"Massive-scale RDF processing using compressed bitmap indexes","author":"Madduri","year":"2011","journal-title":"International Conference on Scientific and Statistical Database Management"},{"key":"10.3233\/IDA-230609_ref17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-319-23826-5_11","article-title":"A compact RDF store using suffix arrays","author":"Brisaboa","year":"2015","journal-title":"International Symposium on String Processing and Information Retrieval"},{"key":"10.3233\/IDA-230609_ref18","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1145\/1367497.1367579","article-title":"Scaling RDF with time","author":"Pugliese","year":"2008","journal-title":"Proceedings of the 17th international conference on World Wide Web"},{"issue":"10","key":"10.3233\/IDA-230609_ref19","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1007\/s00607-019-00703-w","article-title":"Indexing temporal RDF graph","volume":"101","author":"Yan","year":"2019","journal-title":"Computing"},{"issue":"4","key":"10.3233\/IDA-230609_ref20","first-page":"923","article-title":"A methodology for indexing temporal RDF data","volume":"35","author":"Zhao","year":"2019","journal-title":"Journal of Information Science and Engineering"},{"key":"10.3233\/IDA-230609_ref21","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-642-02121-3_25","article-title":"Applied temporal RDF: efficient temporal querying of RDF data with SPARQL","author":"Tappolet","year":"2009","journal-title":"ESWC 2009: The Semantic Web: Research and Applications"},{"issue":"2\u20133","key":"10.3233\/IDA-230609_ref22","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","article-title":"LUBM: a benchmark for OWL knowledge base systems","volume":"3","author":"Guo","year":"2005","journal-title":"Journal of Web Semantics"},{"issue":"2","key":"10.3233\/IDA-230609_ref23","doi-asserted-by":"crossref","first-page":"575","DOI":"10.3233\/IFS-131039","article-title":"Indexing and querying algorithm based on structure indexing for managing massive-scale RDF data","volume":"27","author":"Bae","year":"2014","journal-title":"Journal of Intelligent & Fuzzy Systems"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-230609","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:20:44Z","timestamp":1777454444000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/IDA-230609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,15]]},"references-count":22,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/ida-230609","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,15]]}}}