发布求助
文献互助 智能选刊 最新文献

Proceedings of the 21st International Database Engineering & Applications Symposium最新文献

筛选
英文 中文
Quality Awareness over Graph Pattern Queries 图模式查询的质量意识
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105871
P. Rigaux, Virginie Thion
{"title":"Quality Awareness over Graph Pattern Queries","authors":"P. Rigaux, Virginie Thion","doi":"10.1145/3105831.3105871","DOIUrl":"https://doi.org/10.1145/3105831.3105871","url":null,"abstract":"We examine the problem of quality awareness when querying graph databases. According to quality annotations that denote quality problems appearing in data subgraphs (the annotations typically result from collaborative practices in the context of open data usage like e.g. users' feedbacks), we propose a notion of quality aware (graph pattern) query based on (usage-dependent) quality profiles. In this paper, we present the formal foundations of the approach. We also show how to simply extend a generic state-of-the-art algorithm for graph pattern queries evaluation in order to implement quality awareness at evaluation time and we study its complexity. We then expose implementation guidelines, supported by a proof-of-concept prototype based on the Neo4J graph database management system.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678207","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}
引用次数: 5
Towards Reliable Data Analyses for Smart Cities 迈向智慧城市的可靠数据分析
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105834
T. Araújo, C. Cappiello, N. P. Kozievitch, Demetrio Gomes Mestre, Carlos Eduardo S. Pires, Monica Vitali
{"title":"Towards Reliable Data Analyses for Smart Cities","authors":"T. Araújo, C. Cappiello, N. P. Kozievitch, Demetrio Gomes Mestre, Carlos Eduardo S. Pires, Monica Vitali","doi":"10.1145/3105831.3105834","DOIUrl":"https://doi.org/10.1145/3105831.3105834","url":null,"abstract":"As cities are becoming green and smart, public information systems are being revamped to adopt digital technologies. There are several sources (official or not) that can provide information related to a city. The availability of multiple sources enables the design of advanced analyses for offering valuable services to both citizens and municipalities. However, such analyses would fail if the considered data were affected by errors and uncertainties: Data Quality is one of the main requirements for the successful exploitation of the available information. This paper highlights the importance of the Data Quality evaluation in the context of geographical data sources. Moreover, we describe how the Entity Matching task can provide additional information to refine the quality assessment and, consequently, obtain a better evaluation of the reliability data sources. Data gathered from the public transportation and urban areas of Curitiba, Brazil, are used to show the strengths and effectiveness of the presented approach.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115948606","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}
引用次数: 8
Building Relation Extraction Templates via Unsupervised Learning 通过无监督学习构建关系提取模板
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105845
Ayman El-Kilany, N. Tazi, Ehab Ezzat
{"title":"Building Relation Extraction Templates via Unsupervised Learning","authors":"Ayman El-Kilany, N. Tazi, Ehab Ezzat","doi":"10.1145/3105831.3105845","DOIUrl":"https://doi.org/10.1145/3105831.3105845","url":null,"abstract":"The vast amount of text published daily over the internet pose an opportunity to build unsupervised text mining models with a better or a comparable performance than existing models. In this paper, we investigate the problem of relation extraction and generation from text using an unsupervised model learned from news published online. We propose a clustering-based method to build a dataset of relations examples. News articles are clustered and once a cluster of sentences for each event in each piece of news is formed, relations between important entities in each event cluster are extracted and considered as examples of relations. Relations examples are used to build extraction templates in order to extract and generate readable relations summaries from new instances of news. The proposed unsupervised relation extraction and generation method is evaluated against multiple methods for relation extraction over different datasets where the proposed method has shown a comparable performance.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126423269","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
Efficient Evaluation of Shortest Average Distance Query on Heterogeneous Neighboring Objects in Road Networks 道路网络中异构相邻目标最短平均距离查询的高效评估
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105848
Yuan-Ko Huang, Chun-Hsing Su, Chiang Lee, Chu-Hung Ho
{"title":"Efficient Evaluation of Shortest Average Distance Query on Heterogeneous Neighboring Objects in Road Networks","authors":"Yuan-Ko Huang, Chun-Hsing Su, Chiang Lee, Chu-Hung Ho","doi":"10.1145/3105831.3105848","DOIUrl":"https://doi.org/10.1145/3105831.3105848","url":null,"abstract":"Recently, the research community has introduced various methods for processing the location-based queries on a single type of objects in road networks. However, in real-life applications user may be interested in obtaining information about different types of objects, in terms of their neighboring relationship. The sets of different types of objects closer to each other are termed the heterogeneous neighboring object sets (HNOSs for short). In this paper, we present a novel type of location-based queries, the shortest average distance query (SADQ for short), on the HNOSs in road networks. Given a query object q and a distance d, the SADQ retrieves a HNOS, such that the road distances between any two objects in this set are less than or equal to d and its average road distance to q is the shortest among all HNOSs. As the SADQ provides object information by preserving both the spatial closeness of objects to the query object and the neighboring relationship between objects, it is useful in many fields and application domains. A grid index is first designed to manage information of data objects and road networks, and then the SADQ algorithm is developed, which is combined with the grid index to efficiently process the SADQ. Extensive experiments using real road network datasets demonstrate the efficiency of the proposed SADQ algorithm.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121819129","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
Lightweight Encryption Algorithm Based on Modified XTEA for Low-Resource Embedded Devices 基于改进XTEA的低资源嵌入式设备轻量级加密算法
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105853
Sonia Kotel, Z. Medien, Mohsen Machhout, R. Tourki
{"title":"Lightweight Encryption Algorithm Based on Modified XTEA for Low-Resource Embedded Devices","authors":"Sonia Kotel, Z. Medien, Mohsen Machhout, R. Tourki","doi":"10.1145/3105831.3105853","DOIUrl":"https://doi.org/10.1145/3105831.3105853","url":null,"abstract":"The number of resource-limited wireless devices utilized in many areas of Internet of Things is growing rapidly; there is a concern about privacy and security. Various lightweight block ciphers are proposed; this work presents a modified lightweight block cipher algorithm. A Linear Feedback Shift Register is used to replace the key generation function in the XTEA1 Algorithm. Using the same evaluation conditions, we analyzed the software implementation of the modified XTEA using FELICS (Fair Evaluation of Lightweight Cryptographic Systems) a benchmarking framework which calculates RAM footprint, ROM occupation and execution time on three largely used embedded devices: 8-bit AVR microcontroller, 16-bit MSP microcontroller and 32-bit ARM microcontroller. Implementation results show that it provides less software requirements compared to original XTEA. We enhanced the security level and the software performance.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131364892","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
Social Media Mining: Prediction of Box Office Revenue 社交媒体挖掘:票房收入预测
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105854
Deepankar Choudhery, C. Leung
{"title":"Social Media Mining: Prediction of Box Office Revenue","authors":"Deepankar Choudhery, C. Leung","doi":"10.1145/3105831.3105854","DOIUrl":"https://doi.org/10.1145/3105831.3105854","url":null,"abstract":"In recent years, social media has played a huge role in how we share and communicate our thoughts and opinions. This information can very valuable for companies and governments as it can be used to analyze public mood and opinion which is a very powerful tool. In this paper, we present a system that mines social media content from a platform such as Twitter for predicting future outcomes. Specifically, it uses chatter from Twitter to predict box office revenue of movies by extracting features such as tweets and their sentiments. Then, by using these features, our system constructs a polynomial regression model for predicting box office revenue. Experimental results show the effectiveness of our system in mining social media and predicting box office revenue.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131550395","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}
引用次数: 37
LoRaWAN Bristol
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105835
Steve Battle, Benedict R. Gaster
{"title":"LoRaWAN Bristol","authors":"Steve Battle, Benedict R. Gaster","doi":"10.1145/3105831.3105835","DOIUrl":"https://doi.org/10.1145/3105831.3105835","url":null,"abstract":"The Bristol LoRaWAN Network is a low power radio network for the Internet of Things, based on LoRaWAN and utilising The Things Network. LoRaWAN is a Low Power Wide Area Network (LPWAN) specification intended for wireless battery operated Things in regional, national, or global networks. LoRaWAN targets key requirements of internet of things such as secure bi-directional communication, mobility and localisation services. A 2015 pilot programme in the city of Amsterdam aimed to cover the entire city with just 10 wireless gateways. LoRaWAN Bristol aims to replicate this experiment in the UK.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115531174","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}
引用次数: 8
Quantifying Eventual Consistency For Aggregate Queries 量化聚合查询的最终一致性
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105836
Neil Burke, F. Dehne, A. Rau-Chaplin, D. Robillard
{"title":"Quantifying Eventual Consistency For Aggregate Queries","authors":"Neil Burke, F. Dehne, A. Rau-Chaplin, D. Robillard","doi":"10.1145/3105831.3105836","DOIUrl":"https://doi.org/10.1145/3105831.3105836","url":null,"abstract":"With the advent of inexpensive cloud computing resources, scalable distributed data stores have surged in popularity [7, 10, 16, 17, 20]. Such systems focus on horizontal scalability and take advantage of cheap, pay by the hour, compute nodes provisioned through the cloud [6]. In doing so, these systems are able to distribute query and insert load across many “shared nothing” compute nodes, improving latency and throughput performance. Consequently, the use of multiple compute nodes increases the likelihood that a node may fail at a given time, making availability a critically important quality [10]. Key-value stores typically address this problem by maintaining � redundant replicas of its data set [10, 16]. In doing so, if a single node in the system fails, � − 1 nodes replicating the same data remain accessible. Increasing � increases the availability of a system. However, introducing redundant replication to a system introduces the problem of consistency. Since networks are unpredictable, each insert operation will arrive at the � different replicas at different times. This leads to the data","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125419962","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
Quantification of time in Digital Libraries: Temporal Zipf's law 数字图书馆中时间的量化:时间齐夫定律
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105866
S. Rizzo, D. Montesi
{"title":"Quantification of time in Digital Libraries: Temporal Zipf's law","authors":"S. Rizzo, D. Montesi","doi":"10.1145/3105831.3105866","DOIUrl":"https://doi.org/10.1145/3105831.3105866","url":null,"abstract":"The temporal dimension of a text document defines the temporal scope of its narrated event. This temporal dimension acquires more importance in corpora created along several years of production, such as digital libraries. Temporal aspects of text have been the subject of many researches with specific tasks, notably information retrieval and event detection, while no studies have been conducted to quantify and analyze the richness of the temporal dimension of different text collections. Analysing thirteen text collections we show how the extent and characteristics of the time presence in text varies among collections that have different scopes, although time intervals are mentioned in almost all the text units analyzed. We found that unique intervals follow the same distribution, given by the Zipf's law, that holds for single words.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123144742","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
On the Implementation of an Algebra of Lightweight Ontologies 轻量级本体代数的实现
Proceedings of the 21st International Database Engineering & Applications Symposium Pub Date : 2017-07-12 DOI: 10.1145/3105831.3105856
Rômulo C. Magalhães, M. Casanova, B. Nunes, G. R. Lopes
{"title":"On the Implementation of an Algebra of Lightweight Ontologies","authors":"Rômulo C. Magalhães, M. Casanova, B. Nunes, G. R. Lopes","doi":"10.1145/3105831.3105856","DOIUrl":"https://doi.org/10.1145/3105831.3105856","url":null,"abstract":"This paper1 first argues that ontology design may benefit from treating ontologies as theories and from the definition of a set of operations that map ontologies into ontologies, especially their constraints. The paper then defines the class of ontologies used and proposes four operations to manipulate them. It proceeds to discuss how the operations may help design new ontologies. The core of the paper describes an implementation of the operations as a Protégé plug-in, called OntologyManagerTab, and includes use case examples to validate the discussion.","PeriodicalId":319729,"journal":{"name":"Proceedings of the 21st International Database Engineering & Applications Symposium","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133811430","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信