Proceedings. 12th International Conference on Scientific and Statistica Database Management最新文献

筛选
英文 中文
Implementing geospatial operations in an object-relational database system 在对象-关系数据库系统中实现地理空间操作
J. Freytag, Miro Flasza, Michael Stillger
{"title":"Implementing geospatial operations in an object-relational database system","authors":"J. Freytag, Miro Flasza, Michael Stillger","doi":"10.1109/SSDM.2000.869789","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869789","url":null,"abstract":"Over the last decade the need to implement functions into a DBMS that are application-specific has increased. For this reason today most object-relational DBMS (ORDBMS) provide features that allow the user to include application-specific functions into the DBMS for their execution within database queries. This paper reports on an implementation effort to include spatial operations into an ORDBMS as a basis to support geographic information systems (GIS). Based on the technique of multi-step query processing using z-values we show how to transform \"straight forward\" queries into more sophisticated ones that use the existing ORDBMS as is. That is, existing index methods and existing optimization techniques are sufficient to execute the rewritten queries efficiently. For this purpose we introduce several user-defined functions and types that provide the necessary basis for an efficient implementation. To validate our implementation we used a subset of queries as defined in the SEQUOIA2000 benchmark. Our measurements show that the performance improvements between the original queries and the rewritten ones are dramatic.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115074755","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}
引用次数: 16
TSA-tree: a wavelet-based approach to improve the efficiency of multi-level surprise and trend queries on time-series data tsa树:一种基于小波的方法,用于提高对时间序列数据的多层次惊奇和趋势查询的效率
C. Shahabi, Xiaoming Tian, Wugang Zhao
{"title":"TSA-tree: a wavelet-based approach to improve the efficiency of multi-level surprise and trend queries on time-series data","authors":"C. Shahabi, Xiaoming Tian, Wugang Zhao","doi":"10.1109/SSDM.2000.869778","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869778","url":null,"abstract":"We introduce a novel wavelet based tree structure, termed TSA-tree, which improves the efficiency of multi-level trend and surprise queries on time sequence data. With the explosion of scientific observation data conceptualized as time sequences, we are facing the challenge of efficiently storing, retrieving and analyzing this data. Frequent queries on this data set are to find trends (e.g., global warming) or surprises (e.g., undersea volcano eruption) within the original time series. The challenge, however is that these trend and surprise queries are needed at different levels of abstractions. To support these multi-level trend and surprise queries, sometimes a huge subset of raw data needs to be retrieved and processed. To expedite this process, we utilize our TSA-tree. Each node of the TSA-tree contains pre-computed trends and surprises at different levels. A wavelet transform is used recursively to construct TSA nodes. As a result, each node of TSA tree is readily available for visualization of trends and surprises. In addition, the size of each node is significantly smaller than that of the original time series, resulting in faster I/O operations. However a limitation of TSA-tree is that its size is larger than the original time series. To address this shortcoming, first we prove that the storage space required to store the optimal subtree of TSA-tree (OTSA-tree) is no more than that required to store the original time series without losing any information. Next, we propose two alternative techniques to reduce the size of the OTSA-tree even further while maintaining an acceptable query precision as compared to querying the original time sequences. Utilizing real and synthetic time sequence databases, we compare our techniques with some well known algorithms.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115155110","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}
引用次数: 131
An integrated database system at the national level for water resource engineers and planners of Bangladesh 在国家一级为孟加拉国的水资源工程师和规划人员建立一个综合数据库系统
Md. Abdur Rauf, S. M. Shah-Newaz
{"title":"An integrated database system at the national level for water resource engineers and planners of Bangladesh","authors":"Md. Abdur Rauf, S. M. Shah-Newaz","doi":"10.1109/SSDM.2000.869792","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869792","url":null,"abstract":"This paper discusses practical issues of developing and implementing an integrated database system that contains water resources data having both space and time varying characteristics. This database has been the National Databank for all the data sets relating water resources planning. The logical inter-dependencies between temporal and spatial data sets have been modelled exploiting RDBMS techniques, but with an unusual approach, to make the system aligned with the actual planning process. The integrated design approach has made it possible to develop a number of tools for engineers and planners to support their assessments and decision-making efforts. A metadatabase has been developed using Internet technology on top of the whole system. The work presented in this paper clearly indicates the potential of developing such databases to expedite any process that deals with a wide array of heterogeneous engineering data sets.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126802935","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}
引用次数: 0
Light-weight indexing of general bitemporal data 一般双时间数据的轻量级索引
R. Bliujute, Christian S. Jensen, Simonas Šaltenis, Giedrius Slivinskas
{"title":"Light-weight indexing of general bitemporal data","authors":"R. Bliujute, Christian S. Jensen, Simonas Šaltenis, Giedrius Slivinskas","doi":"10.1109/SSDM.2000.869783","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869783","url":null,"abstract":"Most data managed by existing, real-world database applications is time referenced. Often, two temporal aspects of data are of interest, namely valid time, when data is true in the mini-world, and transaction time, when data is current in the database, resulting in so-called bitemporal data. Like spatial data, bitemporal data thus has associated two-dimensional regions. Such data is in part naturally now-relative: some data is true until the current time, and some data is part of the current database state. So, unlike for spatial data, bitemporal data regions may grow continuously. Existing indices, e.g., B/sup +/and R-trees, typically do not contend well with even small amounts of now-relative data. In contrast, the 4-R index presented in the paper is capable of indexing general bitemporal data efficiently. The different kinds of growing data regions are transformed into stationary regions, which are then indexed by R*-trees. Queries are also transformed to counter the data transformations, yielding a technique with perfect precision and recall. Performance studies indicate that the technique is competitive with the best existing index; and unlike this existing index, the new technique does not require extension of the DBMS kernel.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129715812","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}
引用次数: 33
Serving datacube tuples from main memory 从主存提供数据元组
K. A. Ross, K. A. Zaman
{"title":"Serving datacube tuples from main memory","authors":"K. A. Ross, K. A. Zaman","doi":"10.1109/SSDM.2000.869787","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869787","url":null,"abstract":"Existing datacube precomputation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize given a space limit. However in the context of a data-warehouse receiving frequent \"append\" updates to the database, the cost of keeping these disk-resident cuboids up-to-date can be high. In this paper we propose a main memory based framework which provides rapid response to queries and requires considerably less maintenance cost than a disk based scheme in an append-only environment. For a given datacube query, we first look among a set of previously materialized tuples for a direct answer. If not found, we use a hash based scheme reminiscent of partial match retrieval to rapidly compute the answer to the query from the finest-level data stored in a special in-memory data structure. Our approach is limited to the important class of applications in which the finest granularity tuples of the datacube fit in main memory. We present analytical and experimental results demonstrating the benefits of our approach.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134117492","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}
引用次数: 12
Automatic aggregation using explicit metadata 使用显式元数据的自动聚合
S. Grumbach, L. Tininini
{"title":"Automatic aggregation using explicit metadata","authors":"S. Grumbach, L. Tininini","doi":"10.1109/SSDM.2000.869780","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869780","url":null,"abstract":"The paper presents a logical data model for statistical data with an explicit modeling of metadata, which allows to perform automatic aggregation. The data are stored in standard relations from the relational model, while the metadata, defining the semantics of the relations, are represented by numerical dependencies which specify the way the summary values are defined in terms of micro-data, as well as the interrelationships among summary values. The present model supports standard relational languages such as SQL. Relations with numerical dependencies are then seen as statistical views over initial relations of micro-data. Queries can be asked either against the views or directly against the initial relations, and in this later case answered, when possible, using the views. The numerical dependencies of the views are run together with the query to compute the answer to the query. This is handled in a completely automatic manner with no need for the user to deal with the intricacy of metadata. The mechanism has been tested by an implementation in Prolog of meaningful examples of queries and dependencies. It is shown in particular that various classical problems in the realm of statistical and multidimensional databases can be easily modeled and solved in the present framework. Finally, the proposed formalism is shown to be useful for statistical database schema design.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127986762","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
A tool for nesting and clustering large objects 用于嵌套和集群大型对象的工具
S. Dieker, R. H. Güting, M. R. Luaces
{"title":"A tool for nesting and clustering large objects","authors":"S. Dieker, R. H. Güting, M. R. Luaces","doi":"10.1109/SSDM.2000.869786","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869786","url":null,"abstract":"In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probability of a large object, query performance depends on its representation: either inlined within the aggregate or swapped out to a separate object. Furthermore, the implementation of complex data models often requires nested large objects, and access performance is highly influenced by the clustering strategy followed to store the resulting tree of large objects. In this paper we describe a large object extension which automatically clusters nested large objects. A rank function is developed which indicates the suitability of a large object being inserted into a given cluster. We present two clustering algorithms of different run-time complexity, both using the rank function, and a series of simulations is performed to compare them to each other as well as to two trivial ones. One of the algorithms proves to compute the most efficient clustering in all tests.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117052792","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
Generating network-based moving objects 生成基于网络的移动对象
Thomas Brinkhoff
{"title":"Generating network-based moving objects","authors":"Thomas Brinkhoff","doi":"10.1109/SSDM.2000.869794","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869794","url":null,"abstract":"Benchmarking spatiotemporal database systems requires the generation of suitable datasets simulating the typical behavior of moving objects. Previous approaches do not consider that in many applications the moving objects follow a given network. In this paper, the most important properties of network-based moving objects are presented. These properties are the basis for specifying and developing a new generator for spatiotemporal data. This generator combines a real network with user-defined properties of the resulting dataset. A framework for using and promoting the generator exists.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123007805","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}
引用次数: 117
Supporting content-based searches on time series via approximation 通过近似支持基于内容的时间序列搜索
Changzhou Wang, X. Wang
{"title":"Supporting content-based searches on time series via approximation","authors":"Changzhou Wang, X. Wang","doi":"10.1109/SSDM.2000.869779","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869779","url":null,"abstract":"Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series whose contents are similar to what users specify. The content types studied include shapes, trends, cyclic components, autocorrelation functions and partial autocorrelation functions. Due to the complex nature of the similarity searches involving such contents, traditional database techniques usually cannot provide a fast response when the involved data volume is high. This paper proposes to answer such content-based queries using appropriate approximation techniques. The paper then introduces two specific approximation methods, one is wavelet based and the other line-fitting based. Finally, the paper reports some experiments conducted on a stock price data set as well as a synthesized random walk data set, and shows that both approximation methods significantly reduce the query processing time without introducing intolerable errors.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116703958","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}
引用次数: 117
Knowledge-based integration of neuroscience data sources 基于知识的神经科学数据源集成
Amarnath Gupta, Bertram Ludäscher, M. Martone
{"title":"Knowledge-based integration of neuroscience data sources","authors":"Amarnath Gupta, Bertram Ludäscher, M. Martone","doi":"10.1109/SSDM.2000.869777","DOIUrl":"https://doi.org/10.1109/SSDM.2000.869777","url":null,"abstract":"The need for information integration is paramount in many biological disciplines, because of the large heterogeneity in both the types of data involved and in the diversity of approaches (physiological, anatomical, biochemical, etc.) taken by biologists to study the same or correlated phenomena. However, the very heterogeneity makes the task of information integration very difficult since two approaches studying different aspects of the same phenomena may not even share common attributes in their schema description. The paper develops a wrapper-mediator architecture which extends the conventional data- and view-oriented information mediation approach by incorporating additional knowledge modules that bridge the gap between the heterogeneous data sources. The semantic integration of the disparate local data sources employs F-logic as a data and knowledge representation and reasoning formalism. We show that the rich object oriented modeling features of F-logic together with its declarative rule language and the uniform treatment of data and metadata (schema information) make it an ideal candidate for complex integration tasks. We substantiate this claim by elaborating on our integration architecture and illustrating the approach using real world examples from the neuroscience domain. The complete integration framework is currently under development; a first prototype establishing the viability of the approach is operational.","PeriodicalId":230102,"journal":{"name":"Proceedings. 12th International Conference on Scientific and Statistica Database Management","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121090857","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}
引用次数: 68
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书