{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T08:36:44Z","timestamp":1718008604233},"reference-count":6,"publisher":"National Library of Serbia","issue":"4","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2010]]},"abstract":"<jats:p>The need for efficient access and management of time dependent data in modern\n   database applications is well recognized and researched. Existing access\n   methods are mostly derived from the family of spatial R-tree indexing\n   techniques. These techniques are particularly not suitable to handle data\n   involving open ended intervals, which are common in temporal databases. This\n   is due to overlapping between nodes and huge dead space found in the\n   database. In this study, we describe a detailed investigation of a new\n   approach called ?Triangular Decomposition Tree? (TD-Tree). The underlying\n   idea for the TD-Tree is to manage temporal intervals by virtual index\n   structures relying on geometric interpretations of intervals, and a space\n   partition method that results in an unbalanced binary tree. We demonstrate\n   that the unbalanced binary tree can be efficiently manipulated using a\n   virtual index. We also show that the single query algorithm can be applied\n   uniformly to different query types without the need of dedicated query\n   transformations. In addition to the advantages related to the usage of a\n   single query algorithm for different query types and better space complexity,\n   the empirical performance of the TD-tree has been found to be superior to its\n   best known competitors.<\/jats:p>","DOI":"10.2298\/csis101020035s","type":"journal-article","created":{"date-parts":[[2010,11,12]],"date-time":"2010-11-12T08:02:00Z","timestamp":1289548920000},"page":"679-703","source":"Crossref","is-referenced-by-count":10,"title":["Advanced indexing technique for temporal data"],"prefix":"10.2298","volume":"7","author":[{"given":"Bela","family":"Stantic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney","family":"Topor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Terry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/182.358434"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00176-Y"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0169-023X(95)00034-P"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/69.667079"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/69.824609"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/69.404032"}],"container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:29:57Z","timestamp":1685348997000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141000035S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010]]}},"URL":"https:\/\/doi.org\/10.2298\/csis101020035s","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}