Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.最新文献

筛选
英文 中文
An economic model for resource exchange in mobile peer to peer networks 移动点对点网络中资源交换的经济模型
O. Wolfson, Bo Xu, A. Sistla
{"title":"An economic model for resource exchange in mobile peer to peer networks","authors":"O. Wolfson, Bo Xu, A. Sistla","doi":"10.1109/SSDBM.2004.13","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.13","url":null,"abstract":"Consider an urban area with hundreds of thousands of vehicles. Drivers and passengers in these vehicles are interested in information relevant to their trip. For example, a driver would like his/her vehicle to continuously display on a map the available parking spaces around the current location. Or, the driver may be interested in the traffic conditions (e.g. average speed) one mile ahead. In this paper we examine the dissemination of information about resources in mobile peer-to-peer networks, where vehicles and sensors communicate with each other via short-range wireless transmission. Each disseminated resource represents information about a spatial-temporal event, such as the availability of a parking slot at a particular time. We propose an opportunistic dissemination paradigm, in which a moving object transmits the resources it carries to encountered vehicles and obtains new resources in exchange. We develop and analyze a family of economic models that provide incentive for collaboration in data dissemination. The proposed system has the potential to create a completely new information marketplace.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122259473","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}
引用次数: 45
Scalable spatio-temporal continuous query processing for location-aware services 位置感知服务的可伸缩时空连续查询处理
Xiaopeng Xiong, M. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar
{"title":"Scalable spatio-temporal continuous query processing for location-aware services","authors":"Xiaopeng Xiong, M. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar","doi":"10.1109/SSDBM.2004.61","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.61","url":null,"abstract":"Real-time spatio-temporal query processing needs to effectively handle a large number of moving objects and continuous spatio-temporal queries. In this paper, we use shared execution as a mechanism to support scalability in location-aware servers. Our main idea is to maintain a query table that stores information about continuous spatio-temporal queries. Then, answering spatio-temporal queries is abstracted as a spatial join among the moving objects and queries. Three query join policies are proposed aiming to minimize the cost of the join operation under the shared execution paradigm, namely the clock-triggered join policy, the incremental join policy, and the hot join policy. We introduce the concept of a no-action region that is used in conjunction with the hot join policy. We propose algorithms that calculate the no-action region for objects and queries. Experimental performance demonstrates that the no-action region is more efficient than other approaches when used along with the hot join policy. Experiments also demonstrate that the hot join policy outperforms the clock-triggered join policy and the incremental join policy in terms of both I/O and CPU costs.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"318 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122310510","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}
引用次数: 52
Finding frequent items in sliding windows with multinomially-distributed item frequencies 在具有多项分布项目频率的滑动窗口中查找频繁项目
Lukasz Golab, David DeHaan, A. López-Ortiz, E. Demaine
{"title":"Finding frequent items in sliding windows with multinomially-distributed item frequencies","authors":"Lukasz Golab, David DeHaan, A. López-Ortiz, E. Demaine","doi":"10.1109/SSDBM.2004.37","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.37","url":null,"abstract":"In this paper, we present an algorithm for identifying frequently occurring items within a sliding window of the last N items seen over an infinite data stream, given the following constraints: (1) the relative frequencies of the item types can vary over the lifetime of the stream, provided that they vary sufficiently slowly that for any sliding window of N tuples, with high probability the window could have been generated by a multinomial distribution. We refer to this as the drifting distribution model in the full version of this paper (Golab et al., 2004). (2) The entire sliding window does not fit in the available memory (otherwise, we could simply count all the distinct item types and return those whose frequencies exceed some threshold). (3) The stream may arrive at a high rate, so only a constant number of operations (amortized) is allowed for the processing of each item.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128277793","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}
引用次数: 20
Continuous K-nearest neighbor search for moving objects 移动对象的连续k近邻搜索
Y. Li, Jiong Yang, Jiawei Han
{"title":"Continuous K-nearest neighbor search for moving objects","authors":"Y. Li, Jiong Yang, Jiawei Han","doi":"10.1109/SSDBM.2004.24","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.24","url":null,"abstract":"The paper describes a new method of continuously monitoring the k nearest neighbors of a given object in the mobile environment. Instead of monitoring all k nearest neighbors, we choose to monitor the k-th (nearest) neighbor since the necessary condition of changes in the KNN is the change of the k-th neighbor. In addition, rather than in the original space, we consider the moving objects in a transformed time-distance (TD) space, where each object is represented by a curve. A beach-line algorithm is developed to monitor the change of the k-th neighbor, which enables us to maintain the KNN incrementally. An extensive empirical study shows that the beach-line algorithm outperforms the most efficient existing algorithm by a wide margin, especially when k or n (the total number of objects) is large.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122193297","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}
引用次数: 30
A tree-structured query interface for querying semi-structured data 树状结构的查询接口,用于查询半结构化数据
Scott Newman, Z. M. Özsoyoglu
{"title":"A tree-structured query interface for querying semi-structured data","authors":"Scott Newman, Z. M. Özsoyoglu","doi":"10.1109/SSDBM.2004.9","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.9","url":null,"abstract":"XML is a semistructured data format that is quickly becoming the standard means of communication across the Internet. We introduce a simple, powerful, unambiguous tree-structured user-interface for querying semistructured data. It emphasizes ease-of-use and provides generic access to XML repositories. An implementation of this interface called the Pathways Explorer has been built in the context of biological pathways. The implementation illustrates some basic capabilities, such as selection, projection, equijoins, and self-joins. It builds efficient queries using SQL, and it has been shown that XQuery's performance would be comparable. Future implementations might allow semantic client-side caching, aggregation and grouping, recursion, and set operations.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132529376","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}
引用次数: 10
An information system for material microstructures 材料微结构信息系统
Kathrin Roberts, F. Mücklich, Ralf Schenkel, G. Weikum
{"title":"An information system for material microstructures","authors":"Kathrin Roberts, F. Mücklich, Ralf Schenkel, G. Weikum","doi":"10.1109/SSDBM.2004.15","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.15","url":null,"abstract":"This work presents an information system that supports a materialographic laboratory in class material samples based on microstructure images. The system uses database and Web technologies to manage its information and make it accessible to Internet users. Its core is a class based on support vector machines, that provides an automatic diagnosis of the material class of a given sample. The classifier uses texture features from an underlying image analysis, the so-called Haralick parameters, and stereologic features such as fractal dimension, Euler parameter, etc. In addition to the class the system provides a sensitivity analysis that allows the user to understand which features are most influential for certain class decisions. The system is fully operational and can be used on the Web.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123377085","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
Composing lineage metadata with XML for custom satellite-derived data products 用XML组合自定义卫星派生数据产品的沿袭元数据
R. Bose, J. Frew
{"title":"Composing lineage metadata with XML for custom satellite-derived data products","authors":"R. Bose, J. Frew","doi":"10.1109/SSDBM.2004.23","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.23","url":null,"abstract":"As peer-to-peer dissemination of custom data products evolves among Earth science research groups, investigators and data managers must consider how to compose appropriate metadata for their research computing activities. Because workflows may span multiple groups, it is critical that lineage (provenance) metadata also be assembled to document and preserve the origins and processing history of constituent data products and transformations for future data consumers. To demonstrate methods for composing lineage metadata for custom processing, we introduce our terminology for workflow and employ a case study for the creation of satellite-derived ocean color data products. Our example contributes to a general metadata model for workflow that incorporates lineage. We then discuss metadata requirements for remote sensing-related data products. We propose two techniques for composing lineage metadata, both based on accessory XML metadata documents that are paired with the data products and versioned data transformations they describe. The first technique, implemented as a prototype, features a dedicated lineage server that introduces the indirection and flexibility necessary for Web-based lineage navigation. The second, more promising technique involves defining a simple Resource Description Framework (RDF) vocabulary for lineage metadata, and using extant RDF/XML tools for query and navigation. These methods provide guidelines for composing lineage metadata that are applicable to other domains.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124832980","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}
引用次数: 59
Managing moving objects on dynamic transportation networks 管理动态交通网络中的移动物体
Zhiming Ding, R. H. Güting
{"title":"Managing moving objects on dynamic transportation networks","authors":"Zhiming Ding, R. H. Güting","doi":"10.1109/SSDBM.2004.48","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.48","url":null,"abstract":"One of the key research issues with moving objects databases (MOD) is the modeling of moving objects. In this paper, a new moving objects database model, Moving Objects on Dynamic Transportation Networks (MODTN), is proposed. In MODTN, moving objects are modeled as moving graph points which move only within predefined transportation networks. To express general events of the system, such as traffic jams, temporary constructions, insertion and deletion of junctions or routes, the underlying transportation networks are modeled as dynamic graphs so that the state and the topology of the graph system at any time instant can be tracked and queried. Besides, to track the location of network constrained moving objects, a location update mechanism is provided, and the corresponding uncertainty management issues are analyzed.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115300502","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}
引用次数: 85
A generic algorithmic framework for aggregation of spatio-temporal data 一个用于时空数据聚合的通用算法框架
Seung-Hyun Jeong, A. Fernandes, N. Paton, Tony Griffiths
{"title":"A generic algorithmic framework for aggregation of spatio-temporal data","authors":"Seung-Hyun Jeong, A. Fernandes, N. Paton, Tony Griffiths","doi":"10.1109/SSDBM.2004.4","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.4","url":null,"abstract":"Spatio-temporal databases are often associated with analyses that summarize stored data over spatial, temporal or spatio-temporal dimensions. For example, a study of traffic patterns might explore average traffic densities on a road network at different times, over different areas in space, and over different areas in space at different times. The importance of temporal, spatial and spatio-temporal aggregation has been reflected in a significant number of proposals for algorithms for efficient computation of specific kinds of aggregation. However; although such proposals may be effective in particular cases, as yet there is no generic framework that provides efficient support for the wide range of partitioning and aggregation operations that a spatio-temporal database management system might be expected to support over both stored and derived data. This paper proposes an algorithmic framework that can be applied to many different forms of aggregation, and presents the results of performance studies on an implementation of the framework. These show that the framework provides a scalable solution for the many cases in which the aggregations required over stored and derived data may be widely variable and unpredictable.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127982710","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
Customized answers to summary queries via aggregate views 通过聚合视图自定义摘要查询的答案
F. M. Malvestuto, E. Pourabbas
{"title":"Customized answers to summary queries via aggregate views","authors":"F. M. Malvestuto, E. Pourabbas","doi":"10.1109/SSDBM.2004.26","DOIUrl":"https://doi.org/10.1109/SSDBM.2004.26","url":null,"abstract":"Statistical users typically require summary tables and want fast and accurate answers to their queries. Usually, the query system keeps materialized aggregate views to speed up the evaluation of summary queries. If the summary table on the variable of interest to a statistical user is not derivable from the set of materialized aggregate views, the answer to his query will consist of an estimate and, if the user is a domain expert, he would like to participate in the estimation process. Therefore, he should be left the possibility of \"tuning\" the response to an auxiliary variable, for which either there is a materialized aggregate view or aggregate data can be externally provided by the user himself In this framework, we solve the computational problems related to the estimation of summary queries, and propose efficient algorithms which make use of notions and techniques developed in the theory of acyclic database schemes.","PeriodicalId":383615,"journal":{"name":"Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124759019","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
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学术官方微信