2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)最新文献

筛选
英文 中文
ORA-semantics based keyword search in XML and relational databases XML和关系数据库中基于ora语义的关键字搜索
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495638
T. Ling, Zhong Zeng, T. Le, M. Lee
{"title":"ORA-semantics based keyword search in XML and relational databases","authors":"T. Ling, Zhong Zeng, T. Le, M. Lee","doi":"10.1109/ICDEW.2016.7495638","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495638","url":null,"abstract":"Keyword search in XML and relational databases (RDB) has gained popularity as it provides a user-friendly way to explore structured data. Existing works on XML and RDB keyword search only rely on the structures of XML/RDB data and/or schemas, and this causes serious problems of returning incomplete answers, meaningless answers and overwhelming answers. In this paper, we identify the problems of existing keyword search methods and point out that the main reason of these problems is due to the unawareness of the Object-Relationship-Attribute (ORA) semantics in XML/RDB. We exploit the ORA semantics in XML and RDB, and capture these semantics by constructing the Object tree for XML, and the Object-Relationship-Mixed (ORM) data graph for RDB, respectively. Based on the Object tree and the ORM data graph, we propose an ORA-Semantics based keyword search in XML and RDB. Our semantic approach can avoid the problems of existing methods and improves the completeness and correctness of keyword search. In addition, we extend the keyword query language to include keywords that match the metadata, i.e., the names of tags in XML and the names of relations and attributes in RDB. These keywords reduce the ambiguities of queries and enable us to infer user' search intention more precisely. Finally, we incorporate aggregate functions and GROUPBY into keyword queries to retrieve statistical information from XML and RDB.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129130939","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}
引用次数: 6
IncReStore: Incremental computation of mapreduce workflows IncReStore: mapreduce工作流的增量计算
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495613
Ahmed E. Khalifa, Iman Elghandour, Nagwa M. El-Makky
{"title":"IncReStore: Incremental computation of mapreduce workflows","authors":"Ahmed E. Khalifa, Iman Elghandour, Nagwa M. El-Makky","doi":"10.1109/ICDEW.2016.7495613","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495613","url":null,"abstract":"Many applications in various industrial and research areas analyze large continuously evolving data. Big data analytics platforms such as MapReduce focus on distributed batch processing, and therefore, a query needs to be re-executed every time its input data evolve. In this paper, we present IncReStore, a system that incrementally computes queries on fast growing datasets by materializing query outputs and maintaining them. IncReStore runs in two modes: (1) Opportunistic IncReStore generates compensating queries on the fly during their execution to use previously materialized query outputs taking into account that data might have evolved; and (2) Active IncReStore automatically generates MapReduce jobs to update the materialized query outputs whenever the datasets that they depend on evolve. We have implemented IncReStore as an extension to Pig and Hadoop. Our experimental evaluation of IncRestore using the TPC-H benchmark shows significant speedups.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127580687","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}
引用次数: 0
Enabling persistent identification of groups of duplicates in data aggregators 支持数据聚合器中重复组的持久标识
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495630
G. Alexiou, M. Meimaris, George Papastefanatos
{"title":"Enabling persistent identification of groups of duplicates in data aggregators","authors":"G. Alexiou, M. Meimaris, George Papastefanatos","doi":"10.1109/ICDEW.2016.7495630","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495630","url":null,"abstract":"Data aggregators harvest, deduplicate and make available content from disparate data sources in different domains, such as cultural information, academic, and scientific content. The availability of aggregated data in the form of Linked Data is subject to the evolution of information at the data sources, thus proper handling is necessary for published data to comply with Linked Data guidelines, such as persistent identification through time. In this paper we present the problem of disambiguating groups of duplicates in settings where the Information Space is regenerated at its whole in every harvesting cycle of data aggregation and propose an approach that aims at providing persistent identifiers for groups through time.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121347587","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}
引用次数: 2
A sensor network query processing system for healthcare data acquisition in Dr. M 基于传感器网络的医疗数据采集查询处理系统
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495621
Chanhee Lee, Taehun Kim, S. Hyun
{"title":"A sensor network query processing system for healthcare data acquisition in Dr. M","authors":"Chanhee Lee, Taehun Kim, S. Hyun","doi":"10.1109/ICDEW.2016.7495621","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495621","url":null,"abstract":"In mobile healthcare monitoring services with wearable sensor devices and mobile communications networks, data acquisition is an important issue for the design and implementation of various healthcare application services. In this paper, we present an efficient healthcare data acquisition apparatus by accommodating the notion of query language and processing functions of the sensor network database system. We present our healthcare monitoring service architecture, query language, and data acquisition process. We show how our proposed system implements the intended healthcare data acquisition facility. Our prototype system has been evaluated by using some example queries and a healthcare dataset of an intensive care unit patients to verify the expressiveness of our query language and efficiency of the healthcare data acquisition to support the healthcare applications.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125466173","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}
引用次数: 1
Robust query processing 健壮的查询处理
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495653
S. Karthik
{"title":"Robust query processing","authors":"S. Karthik","doi":"10.1109/ICDEW.2016.7495653","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495653","url":null,"abstract":"Robust query processing, a long-standing problem, is about performance, predictability and ability to avoid sudden disruptions in performance. While query optimizer being an important component of query processing, my thesis focuses on query optimizer robustness which is mainly plagued with the problem of cardinality mis-estimates. Moreover, it is well known that these mis-estimates can lead to orders of magnitude sub-optimal performance. In order to mitigate this problem, there has been considerable work in the literature such as improving quality of statistical meta-data, feedback-based adjustments, on-the-fly reoptimization of queries, etc. Most of these previous approaches are based on heuristics and do not offer worst-case performance bounds. The notable exception to the heuristics based approaches is the PlanBouquet approach which provides a provable worstcase performance guarantees. In PlanBouquet, the selectivities are not estimated but are discovered at run-time using a set (or bouquet) of plans. The PlanBouquet formulation suffers, however, from a systemic drawback - the performance bound is a function of not only the query, but also the underlying database platform. Thus the bound value becomes highly variable. Moreover, it is infeasible to compute the bound value without substantial investments in preprocessing overheads. We present SpillBound, the first algorithm for robust query processing that provides a platform-independent worst-case bound. Specifically, SpillBound delivers a worst-case multiplicative bound of D2 + 3D, where D is simply the number of errorprone predicates in the user query. Consequently, the bound value becomes independent of the optimizer and the database platform, and the guarantee can be issued just by inspecting the query without incurring any additional computational effort. Overall, SpillBound offers a new platform-independent approach to robust query processing.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125635839","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}
引用次数: 0
Workload management for cloud databases via machine learning 通过机器学习管理云数据库的工作负载
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495611
Ryan Marcus, Olga Papaemmanouil
{"title":"Workload management for cloud databases via machine learning","authors":"Ryan Marcus, Olga Papaemmanouil","doi":"10.1109/ICDEW.2016.7495611","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495611","url":null,"abstract":"As elastic IaaS clouds continue to become more cost efficient than on-site datacenters, a wide range of data management applications are migrating to pay-as-you-go cloud computing resources. These diverse applications come with an equally diverse set of performance goals, resource demands, and budget constraints. While existing research has tackled individual tasks such as query placement, scheduling, and resource provisioning to meet these goals and constraints, these techniques fail to provide end-to-end customizable workload management solutions, leading application developers to hand-craft custom heuristics that fit their workload specifications and performance goals. In this vision paper, we argue that workload management challenges can be addressed by leveraging machine learning algorithms. These algorithms can be trained on application-specific properties and performance metrics to automatically learn how to provision resources as well as distribute and schedule the execution of incoming query workloads. Towards this goal, we sketch our vision of WiSeDB, a learning-based service that relies on supervised and reinforcement learning to generate workload management strategies for both static and dynamic workloads.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131018936","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}
引用次数: 9
From user graph to Topics Graph: Towards twitter followee recommendation based on knowledge graphs 从用户图到话题图:基于知识图的twitter关注者推荐
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495629
Danae Pla Karidi
{"title":"From user graph to Topics Graph: Towards twitter followee recommendation based on knowledge graphs","authors":"Danae Pla Karidi","doi":"10.1109/ICDEW.2016.7495629","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495629","url":null,"abstract":"Twitter is a rapidly growing microblogging platform that allows its users to send and read short messages, called tweets. Because of the fact that a user's timeline consists of the latest tweets of their followees (users that they are following), followee recommendation is a problem of significant importance. In this work we propose a followee recommendation approach, which takes advantage of the increasing amount of available social data and specifically the semantic relatedness of topics that interest users. In order to accomplish this we use a Topic Graph, containing a wide variety of topics that will be used for the recommendation process. Today knowledge graphs provide a solid basis for us to construct a full and reliable Topic Graph. Our approach takes advantage of the semantic information retrieved from users' tweets, in order to build an interest profile for each user. Then we use graph theory algorithms in order to calculate user interest similarity using the Topic Graph.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116080682","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}
引用次数: 15
Visual exploration and cohort identification of acute patient histories aggregated from heterogeneous sources 从异质来源汇总的急性患者病史的视觉探索和队列识别
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495620
Rune Saetre, Ø. Nytrø, Stein Jakob Nordbø, A. Steinsbekk
{"title":"Visual exploration and cohort identification of acute patient histories aggregated from heterogeneous sources","authors":"Rune Saetre, Ø. Nytrø, Stein Jakob Nordbø, A. Steinsbekk","doi":"10.1109/ICDEW.2016.7495620","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495620","url":null,"abstract":"How can we use information visualization to support retrospective, exploratory analysis of collections of histories for patients admitted to acute care? This paper describes a novel design for visual cohort identification and exploration. We have developed a tool that integrates multiple, heterogeneous clinical data sources and allows alignment, querying and abstraction in a common workbench. This paper presents results from two projects and a review of related work in the field of information visualization including both presentation and interactive navigation of the information. We have developed an interactive prototype and present the visualization aspect of this prototype and a brief demonstration of its use in a research project with a large cohort of patients. The prototype represents and reasons with patient events in different OWL-formalizations according to the perspective and use: One for integration and alignment of patient records and observations; Another for visual presentation of individual or cohort trajectories. Health researchers have successfully analyzed large cohorts (over 100,000 individuals) using the tool. We have also used the tool to produce interactive personal health time-lines (for more than 10,000 individuals) on the web. Utility, usability and effect have been tested extensively and the results so far are promising. We envision that clinicians who want to learn more about groups of patients and their treatment processes will find the tool valuable. In addition, we believe that the visualization can be useful to researchers looking at data to be statistically evaluated, in order to discover new hypotheses or get ideas for the best analysis strategies. Our main conclusion is that the tool is usable, but it can be challenging to use for large data sets.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123739531","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}
引用次数: 0
Efficient skew handling in online aggregation in the cloud 云中的在线聚合中有效的倾斜处理
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495608
Xiang Ci, Fengming Wang, Yantao Gan, Xiaofeng Meng
{"title":"Efficient skew handling in online aggregation in the cloud","authors":"Xiang Ci, Fengming Wang, Yantao Gan, Xiaofeng Meng","doi":"10.1109/ICDEW.2016.7495608","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495608","url":null,"abstract":"As the development of social network, mobile Internet, etc., an increasing amount of data are being generated, which beyonds the processing ability of traditional data management tools. In many real-life applications, users can accept approximate answers accompanied by accuracy guarantees. One of the most commonly used approaches is online aggregation. Online aggregation responds aggregation queries against the random samples and refines the result as more samples are received. In the era of big data, since more and more data analysis applications are migrated to the cloud, online aggregation in the cloud has also drawn more attention. The problem of data skew can greatly impact the results of online aggregation in the cloud. In fact, there exist two special types of data skew in online aggregation in the cloud. In this paper, we propose two methods to deal with the two types of data skew respectively. We implement our methods in a cloud online aggregation system called COLA and the experimental results demonstrate our methods can remarkably eliminate negative effect of data skew and get better results.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"11 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004027","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}
引用次数: 2
Database exploration: Problems and opportunities 数据库探索:问题与机遇
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495637
G. Mecca
{"title":"Database exploration: Problems and opportunities","authors":"G. Mecca","doi":"10.1109/ICDEW.2016.7495637","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495637","url":null,"abstract":"The classical ways to access data, i.e. through a search engine or by querying a database, have today become insufficient when confronted with the new needs of data exploration and interpretation: at a user request, a search engine retrieves a very large collection of documents, while the query engine of a DBMS grants access to all the data that satisfy certain criteria. Once the documents or the data items have been received, the user can only start reading them and try to make sense of their contents, possibly relying on a ranking function that sorts the results in order of “relevance”. After all, this mechanism only works well when the intention of the search or query is to locate a specific information, such as the address of a restaurant or the salaries of all the employees with a certain position. Instead, ranked retrieval and querying are no longer adequate when the need of the user is being able to quickly examine interesting information, presented in a condensed yet illuminating way.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115270799","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书