Proceedings 18th International Conference on Data Engineering最新文献_第4页

The ATLaS system and its powerful database language based on simple extensions of SQL ATLaS系统及其强大的数据库语言基于SQL的简单扩展

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994734

Haixun Wang, C. Zaniolo

引用次数: 0

Data mining meets performance evaluation: fast algorithms for modeling bursty traffic 数据挖掘满足性能评估:快速算法建模突发流量

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994770

Mengzhi Wang, N. Chan, S. Papadimitriou, C. Faloutsos, T. Madhyastha

{"title":"Data mining meets performance evaluation: fast algorithms for modeling bursty traffic","authors":"Mengzhi Wang, N. Chan, S. Papadimitriou, C. Faloutsos, T. Madhyastha","doi":"10.1109/ICDE.2002.994770","DOIUrl":"https://doi.org/10.1109/ICDE.2002.994770","url":null,"abstract":"Network, Web, and disk I/O traffic are usually bursty and self-similar and therefore cannot be modeled adequately with Poisson arrivals. However, we wish to model these types of traffic and generate realistic traces, because of obvious applications for disk scheduling, network management, and Web server design. Previous models (like fractional Brownian motion and FARIMA, etc.) tried to capture the 'burstiness'. However, the proposed models either require too many parameters to fit and/or require prohibitively large (quadratic) time to generate large traces. We propose a simple, parsimonious method, the b-model, which solves both problems: it requires just one parameter, and can easily generate large traces. In addition, it has many more attractive properties: (a) with our proposed estimation algorithm, it requires just a single pass over the actual trace to estimate b. For example, a one-day-long disk trace in milliseconds contains about 86 Mb data points and requires about 3 minutes for model fitting and 5 minutes for generation. (b) The resulting synthetic traces are very realistic: our experiments on real disk and Web traces show that our synthetic traces match the real ones very well in terms of queuing behavior.","PeriodicalId":191529,"journal":{"name":"Proceedings 18th International Conference on Data Engineering","volume":"55 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120923594","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}

引用次数: 203

A graphical XML query language 一种图形化XML查询语言

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994718

S. Flesca, F. Furfaro, S. Greco

引用次数: 2

Towards meaningful high-dimensional nearest neighbor search by human-computer interaction 利用人机交互实现有意义的高维最近邻搜索

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994777

C. Aggarwal

{"title":"Towards meaningful high-dimensional nearest neighbor search by human-computer interaction","authors":"C. Aggarwal","doi":"10.1109/ICDE.2002.994777","DOIUrl":"https://doi.org/10.1109/ICDE.2002.994777","url":null,"abstract":"Nearest neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representation is often very high. Recent theoretical results have shown that the concept of proximity or nearest neighbors may not be very meaningful for the high dimensional case. Therefore, it is often a complex problem to find good quality nearest neighbors in such data sets. Furthermore, it is also difficult to judge the value and relevance of the returned results. In fact, it is hard for any fully automated system to satisfy a user about the quality of the nearest neighbors found unless he is directly involved in the process. This is especially the case for high dimensional data in which the meaningfulness of the nearest neighbors found is questionable. We address the complex problem of high dimensional nearest neighbor search from the user perspective by designing a system which uses effective cooperation between the human and the computer. The system provides the user with visual representations of carefully chosen subspaces of the data in order to repeatedly elicit his preferences about the data patterns which are most closely related to the query point. These preferences are used in order to determine and quantify the meaningfulness of the nearest neighbors. Our system is not only able to find and quantify the meaningfulness of the nearest neighbors, but is also able to diagnose situations in which the nearest neighbors found are truly not meaningful.","PeriodicalId":191529,"journal":{"name":"Proceedings 18th International Conference on Data Engineering","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123090367","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}

引用次数: 44

Similarity search over time-series data using wavelets 利用小波对时间序列数据进行相似性搜索

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994711

I. Popivanov, Renée J. Miller

引用次数: 317

OntoWebber: a novel approach for managing data on the Web OntoWebber:一种管理Web数据的新方法

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994763

Yuhui Jin, Sichun Xu, S. Decker, G. Wiederhold

引用次数: 15

Exploiting punctuation semantics in data streams 利用数据流中的标点语义

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994733

Peter A. Tucker, D. Maier

引用次数: 10

The BINGO! focused crawler: from bookmarks to archetypes 宾果!聚焦爬虫:从书签到原型

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994746

Sergej Sizov, Stefan Siersdorfer, M. Theobald, G. Weikum

引用次数: 17

NAPA : Nearest Available Parking lot Application 最近可用停车场申请

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994767

Hae Don Chon, D. Agrawal, A. E. Abbadi

引用次数: 22

Using Unity to semi-automatically integrate relational schema 使用Unity半自动集成关系模式

Proceedings 18th International Conference on Data Engineering Pub Date : 2002-08-07 DOI: 10.1109/ICDE.2002.994742

R. Lawrence, K. Barker

引用次数: 4