Proceedings of the 2006 ACM SIGMOD international conference on Management of data最新文献_第7页

Declarative networking: language, execution and optimization 声明式网络:语言、执行和优化

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142485

B. T. Loo, Tyson Condie, M. Garofalakis, David E. Gay, J. Hellerstein, Petros Maniatis, R. Ramakrishnan, Timothy Roscoe, I. Stoica

{"title":"Declarative networking: language, execution and optimization","authors":"B. T. Loo, Tyson Condie, M. Garofalakis, David E. Gay, J. Hellerstein, Petros Maniatis, R. Ramakrishnan, Timothy Roscoe, I. Stoica","doi":"10.1145/1142473.1142485","DOIUrl":"https://doi.org/10.1145/1142473.1142485","url":null,"abstract":"The networking and distributed systems communities have recently explored a variety of new network architectures, both for application-level overlay networks, and as prototypes for a next-generation Internet architecture. In this context, we have investigated declarative networking: the use of a distributed recursive query engine as a powerful vehicle for accelerating innovation in network architectures [23, 24, 33]. Declarative networking represents a significant new application area for database research on recursive query processing. In this paper, we address fundamental database issues in this domain. First, we motivate and formally define the Network Datalog (NDlog) language for declarative network specifications. Second, we introduce and prove correct relaxed versions of the traditional semi-naïve query evaluation technique, to overcome fundamental problems of the traditional technique in an asynchronous distributed setting. Third, we consider the dynamics of network state, and formalize the iheventual consistencyl. of our programs even when bursts of updates can arrive in the midst of query execution. Fourth, we present a number of query optimization opportunities that arise in the declarative networking context, including applications of traditional techniques as well as new optimizations. Last, we present evaluation results of the above ideas implemented in our P2 declarative networking system, running on 100 machines over the Emulab network testbed.","PeriodicalId":416090,"journal":{"name":"Proceedings of the 2006 ACM SIGMOD international conference on Management of data","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114263657","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}

引用次数: 312

Adaptive query processing: why, how, when, what next 自适应查询处理:为什么、如何、何时、接下来做什么

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142603

Amol Deshpande, Joseph M. Hellerstein, Vijayshankar Raman

引用次数: 32

PADS: an end-to-end system for processing ad hoc data PADS:用于处理特别数据的端到端系统

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142568

Mark Daly, Y. Mandelbaum, D. Walker, M. Fernández, Kathleen Fisher, R. Gruber, Xuan Zheng

{"title":"PADS: an end-to-end system for processing ad hoc data","authors":"Mark Daly, Y. Mandelbaum, D. Walker, M. Fernández, Kathleen Fisher, R. Gruber, Xuan Zheng","doi":"10.1145/1142473.1142568","DOIUrl":"https://doi.org/10.1145/1142473.1142568","url":null,"abstract":"Enormous amounts of data exist in \"well-behaved\" formats such as relational tables and XML, which come equipped with extensive tool support. However, vast amounts of data also exist in non-standard or ad hoc data formats, which often lack standard or extensible tools. This deficiency forces data analysts to implement their own tools for parsing, querying, and analyzing their ad hoc data. The resulting tools typically interleave parsing, querying, and analysis, obscuring the semantics of the data format and making it nearly impossible for others to resuse the tools. This proposal describes PADS, an end-to-end system for processing ad hoc data sources. The core of PADS is a declarative language for describing ad hoc data sources and a data-description compiler that produces customizable libraries for parsing the ad hoc data. A suite of tools built around this core includes statistical data-profiling tools, a query engine that permits viewing ad hoc sources as XML and for querying them with XQuery, and an interactive front-end that helps users produce PADS descriptions quickly.","PeriodicalId":416090,"journal":{"name":"Proceedings of the 2006 ACM SIGMOD international conference on Management of data","volume":"50 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133779021","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

Rewriting nested XML queries using nested views 使用嵌套视图重写嵌套XML查询

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142524

Nicola Onose, Alin Deutsch, Y. Papakonstantinou, Emiran Curtmola

引用次数: 59

Redundancy and information leakage in fine-grained access control 细粒度访问控制中的冗余和信息泄漏

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142489

G. Kabra, Ravishankar Ramamurthy, S. Sudarshan

引用次数: 42

OMCAT: optimal maintenance of continuous queries' answers for trajectories OMCAT:对轨迹的连续查询的答案进行最佳维护

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142575

Hui Ding, Goce Trajcevski, P. Scheuermann

引用次数: 8

CS cache engine: data access accelerator for location-based service in mobile environments CS缓存引擎:移动环境中基于位置的服务的数据访问加速器

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142590

Ken C. K. Lee, Wang-Chien Lee, J. Winter, Baihua Zheng, Jianliang Xu

{"title":"CS cache engine: data access accelerator for location-based service in mobile environments","authors":"Ken C. K. Lee, Wang-Chien Lee, J. Winter, Baihua Zheng, Jianliang Xu","doi":"10.1145/1142473.1142590","DOIUrl":"https://doi.org/10.1145/1142473.1142590","url":null,"abstract":"Location-based services (LBS) have emerged as one of the killer applications for mobile and pervasive computing environments. Due to limited bandwidth and scarce client resources, client-side data caching plays an important role of enhancing the data availability and improving the response time. In this demonstration, we present CS Cache Engine suitable for LBS. The underlying caching model is Complementary Space Caching (CS caching) scheme that we have recently presented in [citation]. Different from conventional data caching schemes, CS caching preserves a global view of the database by maintaining physical objects and capturing those objects in the server but not in the cache as Complementary Regions (CRs) in the cache. As a result, with the CS Cache Engine implementing CS caching, client assertiveness on their own answered queries is enhanced so that unnecessary requests over the wireless channel can be avoided; various kinds of location-based queries are naturally supported; and the client's ability to prefetch objects is introduced such that the response time can be further improved. In this demonstration paper, we discuss the architecture and the functionality of the CS Caching Engine that adopts CS caching. Specifically, for this demonstration, a tourist information named TravelGuide is prototyped with the support of this cache engine.","PeriodicalId":416090,"journal":{"name":"Proceedings of the 2006 ACM SIGMOD international conference on Management of data","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123399329","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

Run-time operator state spilling for memory intensive long-running queries 用于内存密集型长时间运行查询的运行时操作符状态溢出

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142513

B. Liu, Yali Zhu, Elke A. Rundensteiner

{"title":"Run-time operator state spilling for memory intensive long-running queries","authors":"B. Liu, Yali Zhu, Elke A. Rundensteiner","doi":"10.1145/1142473.1142513","DOIUrl":"https://doi.org/10.1145/1142473.1142513","url":null,"abstract":"Main memory is a critical resource when processing long-running queries over data streams with state intensive operators. In this work, we investigate state spill strategies that handle run-time memory shortage when processing such complex queries by selectively pushing operator states into disks. Unlike previous solutions which all focus on one single operator only, we instead target queries with multiple state intensive operators. We observe an interdependency among multiple operators in the query plan when spilling operator states. We illustrate that existing strategies, which do not take account of this interdependency, become largely ineffective in this query context. Clearly, a consolidated plan level spill strategy must be devised to address this problem. Several data spill strategies are proposed in this paper to maximize the run-time query throughput in memory constrained environments. The bottom-up state spill strategy is an operator-level strategy that treats all data in one operator state equally. More sophisticated partition-level data spill strategies are then proposed to take different characteristics of the input data into account, including the local output, the global output and the global output with penalty strategies. All proposed state spill strategies have been implemented in the D-CAPE continuous query system. The experimental results confirm the effectiveness of our proposed strategies. In particular, the global output strategy and the global output with penalty strategy have shown favorable results as compared to the other two more localized strategies.","PeriodicalId":416090,"journal":{"name":"Proceedings of the 2006 ACM SIGMOD international conference on Management of data","volume":"655 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123050233","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}

引用次数: 56

On-the-fly sharing for streamed aggregation 流聚合的动态共享

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142543

S. Krishnamurthy, Chung Wu, M. Franklin

引用次数: 210

Contour map matching for event detection in sensor networks 面向传感器网络事件检测的等高线图匹配

Proceedings of the 2006 ACM SIGMOD international conference on Management of data Pub Date : 2006-06-27 DOI: 10.1145/1142473.1142491

Wenwei Xue, Qiong Luo, Lei Chen, Yunhao Liu

引用次数: 213