Open J. DatabasesPub Date : 1900-01-01DOI: 10.19210/OJDB-2015V2I1N01_BUCHMANN
Erik Buchmann, P. Bradley, Klemens Böhm
{"title":"Deriving Bounds on the Size of Spatial Areas","authors":"Erik Buchmann, P. Bradley, Klemens Böhm","doi":"10.19210/OJDB-2015V2I1N01_BUCHMANN","DOIUrl":"https://doi.org/10.19210/OJDB-2015V2I1N01_BUCHMANN","url":null,"abstract":"Many application domains such as surveillance, environmental monitoring or sensor-data processing need upper and lower bounds on areas that are covered by a certain feature. For example, a smart-city infrastructure might need bounds on the size of an area polluted with fine-dust, to re-route combustion-engine traffic. Obtaining such bounds is challenging, because in almost any real-world application, information about the region of interest is incomplete, e.g., the database of sensor data contains only a limited number of samples. Existing approaches cannot provide upper and lower bounds or depend on restrictive assumptions, e.g., the area must be convex. Our approach in turn is based on the natural assumption that it is possible to specify a minimal diameter for the feature in question. Given this assumption, we formally derive bounds on the area size, and we provide algorithms that compute these bounds from a database of sensor data, based on geometrical considerations. We evaluate our algorithms both with a real-world case study and with synthetic data.","PeriodicalId":319123,"journal":{"name":"Open J. Databases","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114324471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Open J. DatabasesPub Date : 1900-01-01DOI: 10.19210/OJDB-V1I1N03_ELBUSHRA
Mawahib Musa Elbushra, Jan Lindström
{"title":"Eventual Consistent Databases: State of the Art","authors":"Mawahib Musa Elbushra, Jan Lindström","doi":"10.19210/OJDB-V1I1N03_ELBUSHRA","DOIUrl":"https://doi.org/10.19210/OJDB-V1I1N03_ELBUSHRA","url":null,"abstract":"One of the challenges of cloud programming is to achieve the right balance between the availability and consistency in a distributed database. Cloud computing environments, particularly cloud databases, are rapidly increasing in importance, acceptance and usage in major applications, which need the partition-tolerance and availability for scalability purposes, but sacrifice the consistency side (CAP theorem). In these environments, the data accessed by users is stored in a highly available storage system, thus the use of paradigms such as eventual consistency became more widespread. In this paper, we review the state-of-the-art database systems using eventual consistency from both industry and research. Based on this review, we discuss the advantages and disadvantages of eventual consistency, and identify the future research challenges on the databases using eventual consistency.","PeriodicalId":319123,"journal":{"name":"Open J. Databases","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122509869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}