{"title":"Peer-to-Peer Semantic Integration of Linked Data","authors":"M. Dimartino, A. Calí, A. Poulovassilis, P. Wood","doi":"10.1007/978-3-319-20424-6_5","DOIUrl":"https://doi.org/10.1007/978-3-319-20424-6_5","url":null,"abstract":"","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"1110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122924812","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":"Business intelligence on complex graph data","authors":"Dritan Bleco, Y. Kotidis","doi":"10.1145/2320765.2320780","DOIUrl":"https://doi.org/10.1145/2320765.2320780","url":null,"abstract":"Advances in the Internet of Things will provide massive amounts of context-aware information that would need to be ingested and understood by supporting IT infrastructures, influencing running processes that trigger actions. As a result, future Business Intelligence (BI) platforms would need to be able to process and analyze complex data. In this paper, we adapt a generic graph model that may be used to represent data in many applications of interest. We then show how analytical queries over these data can be naturally expressed via an OLAP-like aggregation framework we introduce. We describe how ad-hoc aggregations can be easily decomposed into smaller independent computations via a proper query rewriting mechanism. Our techniques provide the basis for selecting materialized views in order to expedite computation of frequent analytical queries in large datasets, enabling data warehousing of collections consisting of millions of graphs. Our experiments demonstrate the benefits of our methods.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"35 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113988807","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 scalable data integration under constraints","authors":"G. Konstantinidis, J. Ambite","doi":"10.1145/2320765.2320835","DOIUrl":"https://doi.org/10.1145/2320765.2320835","url":null,"abstract":"In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and data warehouses. Our context is data integration, so we search for maximally-contained rewritings. We have produced a very scalable and efficient solution for its simplest form, conjunctive queries and views, and we are working towards the full relational case. When considering constraints, the problem is usually divided in two phases: (1) query expansion, which rewrites queries w. r. t. the intentional knowledge and (2) expanded query reformulation using the views. Relevant algorithms have given little attention to the second phase and have studied a limited form of view definition languages overall (namely, only GAV). By looking at the problem from a graph perspective we are able to gain a better insight and develop designs which compactly represent common patterns in the source descriptions, and (optionally) push some computation offline. This allows us to contribute significantly in both aforemention phases individually, tailor one to each other, and moreover address them in a unified way. We intend to provide a solution that supports a variety of ontology languages, and all prevalent view definition languages (G/LAV). Towards such a general and scalable system our preliminary results for the relational case, show an experimental performance about two orders of magnitude faster than current state-of-the-art algorithms, rewriting queries using over 10000 views within seconds.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124346059","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}
Benjamin Bertin, Vasile-Marian Scuturici, E. Risler, Jean-Marie Pinon
{"title":"A semantic approach to life cycle assessment applied on energy environmental impact data management","authors":"Benjamin Bertin, Vasile-Marian Scuturici, E. Risler, Jean-Marie Pinon","doi":"10.1145/2320765.2320796","DOIUrl":"https://doi.org/10.1145/2320765.2320796","url":null,"abstract":"Environmental impact assessment of goods and services is nowadays a major challenge for both economic and ethical reasons. Life Cycle Assessment (LCA) provides a well-accepted methodology for modelling environmental impacts of human activities. One stage of the LCA methodology is Life Cycle Inventory, which consists of decomposing economic activities as elementary processes linked together through interdependency relations. This stage is needed in order to evaluate the environmental impacts of processes. A global analysis of economic activities requires considering a huge amount of elementary processes and interdependency links, making the model difficult to understand. In this paper, we propose a semantic approach for the modelling of lice cycle inventory databases. The method has the advantage of offering a more comprehensible model. We explain our model and illustrate it with life cycle inventory data for the U. S. electricity production.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123018230","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":"Classification rule learning for data linking","authors":"N. Pernelle, Fatiha Saïs","doi":"10.1145/2320765.2320808","DOIUrl":"https://doi.org/10.1145/2320765.2320808","url":null,"abstract":"Many approaches have been defined to link data items automatically. Nevertheless, when data are numerous and when the schema is unknown, most of these approaches are too time-consuming. We propose an approach where classification rules are learnt thanks to a training set made of linked data. These classification rules can then be applied in order to classify data items and reduce the linking space i. e the space made of data item pairs that have to be compared. First experiments have been conducted on RDF data sets describing electronic products.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121041190","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":"Product characteristic weighting for designer from online reviews: an ordinal classification approach","authors":"Jian Jin, P. Ji, Y. Liu","doi":"10.1145/2320765.2320784","DOIUrl":"https://doi.org/10.1145/2320765.2320784","url":null,"abstract":"Online product reviews are a reliable source of customers' sentiments. Directly connecting with customers and designers, online reviews can shorten product development life cycles. The problem arising is, although different techniques for processing online reviews are developed, the techniques are rarely seen on accelerating the design work flows. This paper proposes a two stage framework to learn the importance of characteristics from online reviews which could benefit product design. The first stage is a supervised learning routine to identify product characteristics. This procedure calculates the surrounding words' posterior probability. A linear weight learning algorithm is subsequently shown to reach the product characteristics identification. The second stage focus on meeting customers' needs. Distinct from existing classification and rank algorithms, this stage informs an ordinal classification algorithm to balance the weight of product characteristics. This algorithm depicts a pairwise approach to achieve ordinal classification. Furthermore, an integer none linear programming model is advised, which targets at recovering pairwise results to the original class for each object. Four brands of printer reviews from Amazon and real analysis from two experienced product designers are employed in this experimental study. The results validate the feasibility of the two stage framework, and the possibility to explore targeted models from online reviews for product designers.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132846784","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 quality aware service-oriented web warehouse platform","authors":"Adriana Marotta, Laura González, R. Ruggia","doi":"10.1145/2320765.2320783","DOIUrl":"https://doi.org/10.1145/2320765.2320783","url":null,"abstract":"In order to be a useful tool, a Web Warehouse (WW) should take into account the quality of the data it manages and the quality of the services that provide the source data. It should also have enough flexibility to endure the high volatility of web sources. In this work we propose a WW platform that satisfies these two conditions. It manages data and services quality, measuring quality at the different stages of the system life-cycle and at the same time, using these measures as input for information processing. Additionally, the platform achieves flexibility and configurability because it is strongly based on information-processing services.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132245724","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":"Effects on performance and energy reduction by file relocation based on file-access correlations","authors":"M. Iritani, H. Yokota","doi":"10.1145/2320765.2320794","DOIUrl":"https://doi.org/10.1145/2320765.2320794","url":null,"abstract":"Many recent advanced applications of information systems require large amounts of data to be stored in multiple hard disk drives (HDDs). The placement of data in these drives is quite influential in reducing energy consumption while retaining the performance of the system. Several approaches have been proposed in which frequently accessed files are concentrated into a limited number of drives to enable spin-down of the other drives. However, the placement of infrequently accessed data in these drives is also significant because energy consumption during spin-up to access these data cannot be ignored, particularly when files tending to be used together are placed on many different drives. In this paper, we propose a novel method named PLECO (Placement of files for Latency and Energy Consumption Optimization), which aims to place correlated files into the same drive to reduce power consumption and improve the performance of the system. We simulated and evaluated the proposed method, and these results indicate that our proposal can reduce both the energy consumption and the access latency by up to 32% and 92%, respectively, compared with a baseline system.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133885524","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 a theory for privacy preserving distributed OLAP","authors":"A. Cuzzocrea, E. Bertino, D. Saccá","doi":"10.1145/2320765.2320826","DOIUrl":"https://doi.org/10.1145/2320765.2320826","url":null,"abstract":"Privacy Preserving Distributed OLAP identifies a collection of models, methodologies and algorithms devoted to ensuring the privacy of multidimensional OLAP data cubes in distributed environments. While there is noticeable research on practical and pragmatic aspects of Privacy Preserving OLAP, both in centralized and distributed environments, the active literature is lacking of contributions falling in the theory-side of this emerging research topic. Contrary to this, according to our vision, there is a significant need for theoretical results, which may involve in benefits for a wide spectrum of aspects, such as privacy preserving knowledge fruition schemes and query optimization. Inspired by these considerations, starting from our previous research result where the main privacy preserving distributed OLAP framework has been introduced, this paper proposes some theoretical results that nicely extend the capabilities and the potentialities of the framework above.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116678253","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}
Oscar Rodríguez Rocha, Carmen Criminisi, F. Mondin, L. Goix
{"title":"LODifying personal content sharing","authors":"Oscar Rodríguez Rocha, Carmen Criminisi, F. Mondin, L. Goix","doi":"10.1145/2320765.2320805","DOIUrl":"https://doi.org/10.1145/2320765.2320805","url":null,"abstract":"The advent of contemporary mobile devices and their increasing computing power and location capabilities combined with the most innovative Web technologies has provided mobile users with new possibilities to share experiences on-the-go. The growing quantity of multimedia content present on the Web makes it difficult for mobile users to retrieve suitable content. Typically, users looking for interesting content related to their current position or POI (point of interest), access Web search engines relying on keywords to describe their ideas. Unfortunately such descriptions are often subjective and thus retrieval can be ineffective. To address these issues, our platform provides users with an application targeted for modern mobile devices that allows content acquisition and publication. Published content is automatically analyzed and stored on our server with semantic annotations based on the user's context and content, for further semantic search. We describe how and why we migrated from a triple-tags technology to semantics, hoping for related Linked Data.","PeriodicalId":245167,"journal":{"name":"EDBT/ICDT Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407714","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}