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

SVMAX: a system for secure and valid manipulation of XML data SVMAX:用于安全有效地操作XML数据的系统

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513657

Houari Mahfoud, Abdessamad Imine, M. Rusinowitch

{"title":"SVMAX: a system for secure and valid manipulation of XML data","authors":"Houari Mahfoud, Abdessamad Imine, M. Rusinowitch","doi":"10.1145/2513591.2513657","DOIUrl":"https://doi.org/10.1145/2513591.2513657","url":null,"abstract":"It is increasingly common to find XML views used to enforce access control as found in many applications and commercial database systems. To overcome the overhead of view materialization and maintenance, XML views are necessarily virtual. With this comes the need for answering XML queries posed over virtual views, by rewriting them into equivalent queries on the underlying documents. A major concern here is that query rewriting for recursive XML views is still an open problem, and proposed approaches deal only with non-recursive XML views. Moreover, a small number of works have studied the access rights for updates. In this paper, we present SVMAX (Secure and Valid MAnipulation of XML), the first system that supports specification and enforcement of both read and update access policies over arbitrary XML views (recursive or non). SVMAX defines general and expressive models for controlling access to XML data using significant class of XPath queries and in the presence of the update primitives of W3C XQuery Update Facility. Furthermore, SVMAX features an additional module enabling efficient validation of XML documents after primitive updates of XQuery. The wide use of W3C standards makes of SVMAX a useful system that can be easily integrated within commercial database systems as we will show. We give extensive experimental results, based on real-life DTDs, that show the efficiency and scalability of our system.","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"36 1","pages":"154-161"},"PeriodicalIF":0.0,"publicationDate":"2013-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85899753","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

Stream-join revisited in the context of epoch-based SQL continuous query 在基于epoch的SQL连续查询的上下文中重新讨论了流连接

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

Qiming Chen, M. Hsu

{"title":"Stream-join revisited in the context of epoch-based SQL continuous query","authors":"Qiming Chen, M. Hsu","doi":"10.1145/2351476.2351491","DOIUrl":"https://doi.org/10.1145/2351476.2351491","url":null,"abstract":"The current generation of stream processing systems is in general built separately from the query engine thus lacks the expressive power of SQL and causes significant overhead in data access and movement. This situation has motivated us to leverage the query engine for stream processing.\u0000 Stream-join is a window operation where the key issue is how to punctuate and pair two or more correlated streams. In this work we tackle this issue in the specific context of query engine supported stream processing. We focus on the following problems: a SQL query is definable on bounded relation data but stream data are unbounded, and join multiple streams is a stateful (thus history-sensitive) operation but a SQL query only cares about the current state; further, relation join typically requires relation re-scan in a nested-loop but by nature a stream cannot be re-captured as reading a stream always gets newly incoming data.\u0000 To leverage query processing for analyzing unbounded stream, we defined the Epoch-based Continuous Query (ECQ) model which allows a SQL query to be executed epoch by epoch for processing the stream data chunk by chunk. However, unlike multiple one-time queries, an ECQ is a single, continuous query instance across execution epochs for keeping the continuity of the application state as required by the history-sensitive operations such as sliding-window join.\u0000 To joining multiple streams, we further developed the techniques to cache one or more consecutive data chunks falling in a sliding window across query execution epochs in the ECQ instance, to allow them to be re-delivered from the cache. In this way join multiple streams and self-join a single stream in the data chunk based window or sliding window, with various pairing schemes, are made possible.\u0000 We extended the PostgreSQL engine to support the proposed approach. Our experience has demonstrated its value.","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"89 1","pages":"130-138"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79982345","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

Resource allocation algorithm for a relational join operator in grid systems 网格系统中关系连接算子的资源分配算法

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

D. Cokuslu, A. Hameurlain, K. Erciyes, F. Morvan

引用次数: 2

DYMOND: an active system for dynamic vertical partitioning of multimedia databases DYMOND:用于多媒体数据库动态垂直分区的活动系统

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

L. Rodríguez-Mazahua, Xiaoou Li, Jair Cervantes, Farid García

引用次数: 4

Evolving social data mining and affective analysis methodologies, framework and applications 不断发展的社会数据挖掘和情感分析方法、框架和应用

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

A. Vakali

引用次数: 8

A stream query language TPQL for anomaly detection in facility management 一种用于设备管理异常检测的流查询语言TPQL

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

Makoto Imamura, S. Takayama, T. Munaka

引用次数: 2

TEEPA: a timely-aware elastic parallel architecture TEEPA:一个时效性的弹性并行架构

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

J. Costa, P. Martins, J. Cecílio, P. Furtado

{"title":"TEEPA: a timely-aware elastic parallel architecture","authors":"J. Costa, P. Martins, J. Cecílio, P. Furtado","doi":"10.1145/2351476.2351480","DOIUrl":"https://doi.org/10.1145/2351476.2351480","url":null,"abstract":"Parallel Shared-Nothing architectures are frequently used to handle large star-schema Data Warehouses (DW). The continuous increase in data volume and the star-schema storage organization introduce severe limitations to scalability due to the well-known parallel join issues and the resulting need to use solutions such as on-the fly repartitioning of data or intermediate results, or massive replication of large data sets that still need to be joined locally, constraining their ability to deliver fast results. Parallelism may improve query performance, however some business decisions may require that query results be timely available which, even with additional parallelism and significant upgrade costs (both monetary and due to disturbance of normal operations), cannot be guaranteed. We propose a Timely-aware Execution Parallel Architecture (TEEPA) which balances data load and query processing among an elastic set of non-dedicated heterogeneous nodes in order to provide scale-out performance and timely query results. Data is allocated using adaptable storage models to minimize join costs (the major uncertainty factor) which best fit the nodes' capabilities, while preserving a consistent logical view of the star-schema. We present experimental evaluation of TEEPA and demonstrate its ability to provide timely results.","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"37 1","pages":"24-31"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75154667","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 cooperative scheme to aggregate spatio-temporal events in VANETs VANETs时空事件聚合的协同方案

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

D. Zekri, Bruno Defude, T. Delot

引用次数: 3

Incrementally maintaining run-length encoded attributes in column stores 在列存储中增量地维护运行长度的编码属性

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

Abhijeet Mohapatra, M. Genesereth

引用次数: 6

The QOL approach for optimizing distributed queries without complete knowledge 在没有完全知识的情况下优化分布式查询的QOL方法

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

L. Martínez, C. Collet, Christophe Bobineau, Etienne Dublé

引用次数: 5