Proceedings. International Database Engineering and Applications Symposium最新文献_第6页

A constrained frequent pattern mining system for handling aggregate constraints 一种处理聚合约束的约束频繁模式挖掘系统

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351479

C. Leung, Fan Jiang, Lijing Sun, Yan Wang

引用次数: 12

Efficient graph management based on bitmap indices 基于位图索引的高效图形管理

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351489

Norbert Martínez-Bazan, Miquel Angel Aguila-Lorente, V. Muntés-Mulero, David Dominguez-Sal, S. Gómez-Villamor, J. Larriba-Pey

引用次数: 41

Sample-based forecasting exploiting hierarchical time series 利用分层时间序列的基于样本的预测

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351490

Ulrike Fischer, Frank Rosenthal, Wolfgang Lehner

{"title":"Sample-based forecasting exploiting hierarchical time series","authors":"Ulrike Fischer, Frank Rosenthal, Wolfgang Lehner","doi":"10.1145/2351476.2351490","DOIUrl":"https://doi.org/10.1145/2351476.2351490","url":null,"abstract":"Time series forecasting is challenging as sophisticated forecast models are computationally expensive to build. Recent research has addressed the integration of forecasting inside a DBMS. One main benefit is that models can be created once and then repeatedly used to answer forecast queries. Often forecast queries are submitted on higher aggregation levels, e. g., forecasts of sales over all locations. To answer such a forecast query, we have two possibilities. First, we can aggregate all base time series (sales in Austria, sales in Belgium...) and create only one model for the aggregate time series. Second, we can create models for all base time series and aggregate the base forecast values. The second possibility might lead to a higher accuracy but it is usually too expensive due to a high number of base time series. However, we actually do not need all base models to achieve a high accuracy, a sample of base models is enough. With this approach, we still achieve a better accuracy than an aggregate model, very similar to using all models, but we need less models to create and maintain in the database. We further improve this approach if new actual values of the base time series arrive at different points in time. With each new actual value we can refine the aggregate forecast and eventually converge towards the real actual value. Our experimental evaluation using several real-world data sets, shows a high accuracy of our approaches and a fast convergence towards the optimal value with increasing sample sizes and increasing number of actual values respectively.","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"34 1","pages":"120-129"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82453641","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

A mediator-based system for distributed semantic provenance management systems 分布式语义来源管理系统的基于中介的系统

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351499

Mohamed Amin Sakka, Bruno Defude

{"title":"A mediator-based system for distributed semantic provenance management systems","authors":"Mohamed Amin Sakka, Bruno Defude","doi":"10.1145/2351476.2351499","DOIUrl":"https://doi.org/10.1145/2351476.2351499","url":null,"abstract":"Today, most of the applications exchanging and processing documents on the web or in clouds become provenance aware and provides heterogeneous, decentralized and not interoperable provenance data. Provenance is becoming a key metadata for assessing electronic documents trustworthiness and should be considered as first class data.\u0000 Most of provenance management systems are either dedicated to a specific application (workflow, database) or a specific data type. Moreover, in modern infrastructures such as cloud, applications can be deployed and are executed on several provider infrastructure. So, there is a need to track the provenance of applications between different provenance providers. For these reasons, modeling, collecting and querying provenance across heterogeneous distributed sources is considered as a challenging task. In this paper, we introduce a framework based on semantic web models supporting syntactic and semantic heterogeneity of provenance sources and correlations between multiple sources. This framework is implemented as a provenance management system (or PMS). We focus on the design of a mediator based system allowing to federate distributed PMSs and we present optimization issues related to distributed query processing.","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"56 1","pages":"193-198"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85513613","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}

引用次数: 4

UBIQUEST, for rapid prototyping of networking applications UBIQUEST，用于网络应用的快速原型设计

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351498

A. Ahmad-Kassem, Christophe Bobineau, C. Collet, Etienne Dublé, S. Grumbach, Fuda Ma, L. Martínez, S. Ubéda

引用次数: 4

Mining GPS traces to recommend common meeting points 挖掘GPS轨迹，推荐常见的会面地点

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351497

Sonia Khetarpaul, S. K. Gupta, L. V. Subramaniam, Ullas Nambiar

{"title":"Mining GPS traces to recommend common meeting points","authors":"Sonia Khetarpaul, S. K. Gupta, L. V. Subramaniam, Ullas Nambiar","doi":"10.1145/2351476.2351497","DOIUrl":"https://doi.org/10.1145/2351476.2351497","url":null,"abstract":"Scheduling a meeting is a difficult task for people who have overbooked calendars and many constraints. The complexity increases when the meeting is to be scheduled between parties who are situated in geographically distant locations of a city and have varying travel patterns. In this paper, we present a solution that identifies a common meeting point for a group of users who have temporal and spatial locality constraints that vary over time. The problem entails answering an Optimal Meeting Point (OMP) query in spatial databases. Under Euclidean space OMP query solution identification gets reduced to the problem of determining the geometric median of a set of points, a problem for which no exact solution exists. The OMP problem does not consider any constraints as far as availability of users is concerned whereas that is a key constraint in our setting. We therefore focus on finding a solution that uses daily movements information obtained from GPS traces for each user to compute stay points during various times of the day. We then determine interesting locations by analyzing the stay points across multiple users. The novelty of our solution is that the computations are done within the database by using various relational algebra operations in combination with statistical operations on the GPS trajectory data. This makes our solution scalable to larger groups of users and for multiple such requests. Once this list of stay points and interesting locations are obtained, we show that this data can be utilized to construct spatio-temporal graphs for the users that allow us efficiently decide a meeting place. We perform experiments on a real-world dataset and show that our method is effective in finding an optimal meeting point between two users.","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"30 1","pages":"181-186"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80318878","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}

引用次数: 7

Mining probabilistic datasets vertically 垂直挖掘概率数据集

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351500

C. Leung, S. Tanbeer, Bhavek P. Budhia, Lauren C. Zacharias

引用次数: 19

Differential evolution versus genetic algorithms: towards symbolic aggregate approximation of non-normalized time series 差分进化与遗传算法:非归一化时间序列的符号聚合近似

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351501

Muhammad Marwan Muhammad Fuad

引用次数: 18

Partitioning XML documents for iterative queries 为迭代查询划分XML文档

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351483

N. Bidoit, Dario Colazzo, Noor Malla, C. Sartiani

引用次数: 10

Efficient MD5 hash reversing using D.E.A. framework for sharing computational resources 高效MD5哈希反转使用d.e.a框架共享计算资源

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2012-08-08 DOI: 10.1145/2351476.2351502

Nunzio Cassavia, E. Masciari

引用次数: 0