{"title":"Will Internet of Things flood DGSS with data?","authors":"A. Zaslavsky","doi":"10.1109/ICDEW.2013.6547444","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547444","url":null,"abstract":"The Internet of Things (IoT) is part of Future Internet and will comprise many billions of Internet Connected Objects (ICO) or “things” where things can sense, communicate, compute and potentially actuate as well as have intelligence, multimodal interfaces, physical/virtual identities, attributes. IoT incorporates most concepts from pervasive, ubiquitous and ambient computing which have become very popular in recent years [1]. The IoT fuses digital and physical worlds by bringing different concepts and technical components together.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124236766","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}
{"title":"On the link(s) between “D” and “A” in Mobile Data Analytics","authors":"Goce Trajcevski","doi":"10.1109/ICDEW.2013.6547442","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547442","url":null,"abstract":"This paper addresses the issue of (meta) management of the efficiency in the realm of applications relying on Mobile Data Analytics (MODA). We postulate that considering the efficient execution of the tasks of gathering, storing/retrieving and querying spatio-temporal data separately from the efficiency of executing control and decision-making (or, for that matter, even model-selection) algorithms may not be the most beneficial avenue in MODA settings. We argue that an important component is the management of the dynamics of the different tradeoff(s) and, more importantly, linking them when orchestrating the processes of the data management and analytics. Towards that end, we present the DNA2 (Data's Natural Associations with Analytics) hypothesis for coupling the data and control aspects in MODA contexts. We discuss in detail the role of uncertainty, along with some aspects of declarative specifications for merging the reactive and the pro-active behavior in MODA.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124158684","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}
{"title":"Recommending environmental knowledge as linked open data cloud using semantic machine learning","authors":"Ahsan Morshed, R. Dutta, J. Aryal","doi":"10.1109/ICDEW.2013.6547421","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547421","url":null,"abstract":"Large scale environmental knowledge integration and development of a knowledge recommendation system for the Linked Open Data Cloud using semantic machine learning approach was the main mission of this research. This study considered five different environmental big data sources including SILO, AWAP, ASRIS, MODIS and CosmOz complementary for knowledge integration. Unsupervised clustering techniques based on principal component analysis (PCA) and Fuzzy-C-Means (FCM) and Self-organizing map (SOM) clustering was used to learn the extracted features and to create a 2D map based dynamic knowledge recommendation system. Knowledge was stored in a triplestore using triples format (subject, predicate, and object) along with the complete meta-data provenance information. The Resource Description Framework (RDF) representation made i-EKbase very flexible to integrate with the Linked Open Data (LOD) cloud. The developed Intelligent Environmental Knowledgebase (i-EKbase) could be used for any environmental decision support application.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126465912","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}
Rui Wang, Quoc Trung Tran, I. Jimenez, N. Polyzotis
{"title":"INUM+: A leaner, more accurate and more efficient fast what-if optimizer","authors":"Rui Wang, Quoc Trung Tran, I. Jimenez, N. Polyzotis","doi":"10.1109/ICDEW.2013.6547426","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547426","url":null,"abstract":"INUM is a what-if optimization technique that efficiently estimates the cost of optimal query plans under hypothetical index configurations and can thus serve as a fast alternative to conventional what-if optimization. In this paper we introduce three crucial enhancements to INUM: a principled method to handle query plans with Nested-Loop Join (NLJ) operators (to improve estimation accuracy); a method to reduce the time to preprocess a query in the workload (to reduce setup latency); and, a method to prune the amount of information stored per query (to improve estimation efficiency). We demonstrate experimentally that these improvements make INUM 5x faster and improve median estimation accuracy by 79%. Our work extends significantly the scope of workloads and tuning problems to which INUM can be applied.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133576188","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}
Emmanuel Müller, Patricia Iglesias Sánchez, Y. Mülle, Klemens Böhm
{"title":"Ranking outlier nodes in subspaces of attributed graphs","authors":"Emmanuel Müller, Patricia Iglesias Sánchez, Y. Mülle, Klemens Böhm","doi":"10.1109/ICDEW.2013.6547453","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547453","url":null,"abstract":"Outlier analysis is an important data mining task that aims to detect unexpected, rare, and suspicious objects. Outlier ranking enables enhanced outlier exploration, which assists the user-driven outlier analysis. It overcomes the binary detection of outliers vs. regular objects, which is not adequate for many applications. Traditional outlier ranking techniques focus on either vector data or on graph structures. However, many of today's databases store both, multi dimensional numeric information and relations between objects in attributed graphs. An open challenge is how outlier ranking should cope with these different data types in a unified fashion. In this work, we propose a first approach for outlier ranking in subspaces of attributed graphs. We rank graph nodes according to their degree of deviation in both graph and attribute properties. We describe novel challenges induced by this combination of data types and propose subspace analysis as important method for outlier ranking on attributed graphs. Subspace clustering provides a selected subset of nodes and its relevant attributes in which deviation of nodes can be observed. Our graph outlier ranking (GOutRank) introduces scoring functions based on these selected subgraphs and subspaces. In addition to this technical contribution, we provide an attributed graph extracted from the Amazon marketplace. It includes a ground truth of real outliers labeled in a user experiment. In order to enable sustainable and comparable research results, we publish this database on our website1 as benchmark for future publications. Our experiments on this graph demonstrate the potential and the capabilities of outlier ranking in subspaces of attributed graphs.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114629663","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}
{"title":"ISP business models in caching","authors":"Jörn Künsemöller, N. Zhang, J. Soares","doi":"10.1109/ICDEW.2013.6547463","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547463","url":null,"abstract":"Internet traffic volume is increasing and as a consequence, Internet content delivery is facing scalability issues. Different types of caching solutions improve this scalability. The incentives of different stakeholders to pay for the caching solutions are not known. However, it has been identified that Internet service providers (ISPs) need to be involved in the process of cache deployment due to their ownership of the network. Thus, this work first identifies the different business models of ISPs in a caching environment and utilizes game theory to evaluate these possible business models. Although ISP caching is potentially unstable, it turns out to be Pareto optimal at the right pricing, which encourages cooperation between content providers and ISPs.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123191648","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}
{"title":"A vision for SPARQL multi-query optimization on MapReduce","authors":"Kemafor Anyanwu","doi":"10.1109/ICDEW.2013.6547420","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547420","url":null,"abstract":"MapReduce has emerged as a key component of large scale data analysis in the cloud. However, it presents challenges for SPARQL query processing because of the absence of traditional join optimization machinery like statistics, indexes and techniques for translation of join-intensive workloads to efficient MapReduce workflows. Further, MapReduce is primarily a batch processing paradigm. Therefore, it is plausible that many workloads will include a batch of queries or new queries could be generated from given queries e.g. due to query rewriting of inferencing queries. Consequently, the issue of multi-query optimization deserves some focus and this paper lays out a vision for rule-based multi-query optimization based on a recently proposed data model and algebra, Nested TripleGroup Data Model and Algebra, for efficient SPARQL query processing on MapReduce.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114901379","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}
{"title":"Automated educated guessing","authors":"A. Stupar, S. Michel","doi":"10.1109/ICDEW.2013.6547417","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547417","url":null,"abstract":"We describe the vision of a system that performs “educated guessing” to answer ad hoc information needs in case of missing or undisclosed information. The guessing procedure is based on discovered common patterns, obtained from structured and semi-structured data, guided by the specific information need.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116931382","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}
{"title":"Towards elastic key-value stores on IaaS","authors":"Han Li","doi":"10.1109/ICDEW.2013.6547469","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547469","url":null,"abstract":"Key-value stores such as Cassandra and HBase have gained popularity as for their scalability and high availability in the face of heavy workloads and hardware failure. Many enterprises are deploying applications backed by key-value stores on to resources leased from Infrastructure as a Service (IaaS) providers. However, current key-value stores are unable to take full advantage of the resource elasticity provided by IaaS providers due to several challenges: i) high performance of data access in virtualised environments; ii) load-rebalancing as the system scales up and down; and iii) the lack of autoscaling controllers. In this paper I present my research efforts on addressing these issues to provide an elastic key-value store deployed in IaaS environments.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227390","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}
{"title":"Making the H-index more relevant: A step towards standard classes for citation classification","authors":"Mohammad Abdullatif","doi":"10.1109/ICDEW.2013.6547476","DOIUrl":"https://doi.org/10.1109/ICDEW.2013.6547476","url":null,"abstract":"The H-index is gaining popularity as a way of measuring the research impact of an academic paper. However, it has been criticized because it gives all citations equal weight. Citation classification can solve this criticism by categorising citations based on the purpose or function of the citation. An important element for performing citation classification is the presence of a standard set of classes (known as a classification scheme) to enable the comparison between the accuracy of the different techniques currently used to perform citation classification. Such a standard scheme is not available and therefore we aim to fill this gap by generating a citation classification scheme automatically. The scheme is generated by clustering four large datasets of sentences containing citations using X-means. The main contribution of this research is adapting the similarity distance between verbs extracted from the citation sentences using WordNet.","PeriodicalId":358989,"journal":{"name":"2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125615142","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}