Ryohei Azuma, T. Hochin, Hiroki Nomiya, H. Nakanishi, M. Kojima
{"title":"时间序列相似检索系统并行处理研究","authors":"Ryohei Azuma, T. Hochin, Hiroki Nomiya, H. Nakanishi, M. Kojima","doi":"10.1109/SNPD.2012.86","DOIUrl":null,"url":null,"abstract":"This paper uses Postgre SQL, a database management system, in the data management of the similarity retrieval of subsequences of waveforms. By using Postgre SQL, the management of data could become easy, and a multi-dimensional index structure named the R tree could be used. This paper examines the parallel processing of the similarity retrieval by dividing a table into several tables. It is shown that high retrieval performance can easily be obtained by using a high performance computer. It is shown that using Postgre SQL could make the division of a table easy because R tree indexes are automatically constructed.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards Parallel Processing of Similarity Retrieval System of Time Series\",\"authors\":\"Ryohei Azuma, T. Hochin, Hiroki Nomiya, H. Nakanishi, M. Kojima\",\"doi\":\"10.1109/SNPD.2012.86\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper uses Postgre SQL, a database management system, in the data management of the similarity retrieval of subsequences of waveforms. By using Postgre SQL, the management of data could become easy, and a multi-dimensional index structure named the R tree could be used. This paper examines the parallel processing of the similarity retrieval by dividing a table into several tables. It is shown that high retrieval performance can easily be obtained by using a high performance computer. It is shown that using Postgre SQL could make the division of a table easy because R tree indexes are automatically constructed.\",\"PeriodicalId\":387936,\"journal\":{\"name\":\"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2012.86\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2012.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Towards Parallel Processing of Similarity Retrieval System of Time Series
This paper uses Postgre SQL, a database management system, in the data management of the similarity retrieval of subsequences of waveforms. By using Postgre SQL, the management of data could become easy, and a multi-dimensional index structure named the R tree could be used. This paper examines the parallel processing of the similarity retrieval by dividing a table into several tables. It is shown that high retrieval performance can easily be obtained by using a high performance computer. It is shown that using Postgre SQL could make the division of a table easy because R tree indexes are automatically constructed.