Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001最新文献_第2页

Integrating distributed scientific data sources with MOCHA and XRoaster 集成分布式科学数据源与MOCHA和XRoaster

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938560

M. Rodríguez-Martínez, N. Roussopoulos, J. McGann

引用次数: 2

An information system for distillation data farming 蒸馏数据农业信息系统

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938563

A. Lewis, J. Berlin, Ted Meyer, S. Kruglikov, Steve Miller, IV JohnW.Lyver, R. Gharavi

引用次数: 1

Cost-based unbalanced R-trees 基于成本的非平衡r树

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938552

K. A. Ross, I. Sitzmann, Peter James Stuckey

{"title":"Cost-based unbalanced R-trees","authors":"K. A. Ross, I. Sitzmann, Peter James Stuckey","doi":"10.1109/SSDM.2001.938552","DOIUrl":"https://doi.org/10.1109/SSDM.2001.938552","url":null,"abstract":"Cost-based unbalanced R-trees (CUR-trees) are a cost-function-based data structure for spatial data. CUR-trees are constructed specifically to improve the evaluation of intersection queries, the most basic selection query in an R-tree. A CUR-tree is built taking into account a given query distribution for the queries and a cost model for their execution. Depending on the expected frequency of access, objects or subtrees are stored higher up in the tree. After each insertion in the tree, local reorganizations of a node and its children have their expected query cost evaluated, and a reorganization is performed if this is beneficial. No strict balancing of the trees applies, allowing the tree to unfold solely based on the result of the cost evaluation. We present our cost-based approach and describe the evaluation and reorganization operations based on the cost function. We present a cost model for in-memory access costs and we present three different query models. In our experiments, we compare the performance of the CUR-tree to the R-tree and the R*-tree. The CUR-tree is able to significantly improve intersection query performance, without unacceptably increasing the cost of building the tree. The use of R-trees for in-memory data reflects the high (and growing) cost of bringing data from RAM into the CPU cache relative to the cost of other computations.","PeriodicalId":129323,"journal":{"name":"Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114932117","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}

引用次数: 13

Efficient historical R-trees 高效的历史r树

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938554

Yufei Tao, D. Papadias

引用次数: 112

Earth System Science Workbench: a data management infrastructure for earth science products 地球系统科学工作台:地球科学产品的数据管理基础设施

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938550

J. Frew, R. Bose

引用次数: 129

Using association rules to add or eliminate query constraints automatically 使用关联规则自动添加或消除查询约束

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938545

A. Trigoni, K. Moody

引用次数: 5

OLAP databases and aggregation functions OLAP数据库和聚合函数

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938542

H. Lenz, B. Thalheim

引用次数: 58

2D TSA-tree: a wavelet-based approach to improve the efficiency of multi-level spatial data mining 二维tsa树:一种提高多层次空间数据挖掘效率的小波方法

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938538

C. Shahabi, Seokkyung Chung, Maytham Safar, G. Hajj

{"title":"2D TSA-tree: a wavelet-based approach to improve the efficiency of multi-level spatial data mining","authors":"C. Shahabi, Seokkyung Chung, Maytham Safar, G. Hajj","doi":"10.1109/SSDM.2001.938538","DOIUrl":"https://doi.org/10.1109/SSDM.2001.938538","url":null,"abstract":"Due to the large amount of the collected scientific data, it is becoming increasingly difficult for scientists to comprehend and interpret the available data. Moreover typical queries on these data sets are in the nature of identifying (or visualizing) trends and surprises at a selected sub-region in multiple levels of abstraction rather than identifying information about a specific data point. The authors propose a versatile wavelet-based data structure, 2D TSA-tree (Trend and Surprise Abstractions Tree), to enable efficient multi-level trend detection on spatial data at different levels. We show how 2D TSA-tree can be utilized efficiently for sub-region selections. Moreover, 2D TSA-tree can be utilized to precompute the reconstruction error and retrieval time of a data subset in advance in order to allow the user to trade off accuracy for response time (or vice versa) at query time. Finally, when the storage space is limited, our 2D Optimal TSA-tree saves on storage by storing only a specific optimal subset of the tree. To demonstrate the effectiveness of our proposed methods, we evaluated our 2D TSA-tree using real and synthetic data. Our results show that our method outperformed other methods (DFT and SVD) in terms of accuracy, complexity and scalability.","PeriodicalId":129323,"journal":{"name":"Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001","volume":"491 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125670647","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

Semistructured probabilistic databases 半结构化概率数据库

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938536

Alex Dekhtyar, J. Goldsmith, Sean R. Hawkes

引用次数: 24

Content-based browsing of data from the Tropical Rainfall Measuring Mission (TRMM) 基于内容的热带雨量测量任务(TRMM)数据浏览

Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001 Pub Date : 2001-07-18 DOI: 10.1109/SSDM.2001.938562

O. Kelley, J. Stout, M. Kafatos

引用次数: 1