发布求助
文献互助 智能选刊 最新文献

Proceedings of the Twelfth International Conference on Data Engineering最新文献

筛选
英文 中文
A graph-theoretic approach to indexing in object-oriented databases 面向对象数据库中索引的图论方法
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492111
Boris Shidlovsky, E. Bertino
{"title":"A graph-theoretic approach to indexing in object-oriented databases","authors":"Boris Shidlovsky, E. Bertino","doi":"10.1109/ICDE.1996.492111","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492111","url":null,"abstract":"A graph theoretic approach to the path indexing problem is proposed. We represent the indexing relationships supported by indices allocated in the classes in the path in the form of a directed graph. All the previous approaches directly fit into the scheme and form a hierarchy of complexity with respect to the time required for selection of the optimal index configuration. Based on the general scheme, we develop a new approach to the path indexing problem exploiting the notion of visibility graph. We introduce a generalized nested inherited index, give algorithms for retrieval and update operations and compare the behavior of the new structure with previous approaches.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127540737","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}
引用次数: 17
VISUAL: a graphical icon-based query language 一种基于图形图标的查询语言
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492203
N. H. Balkir, Eser Sükan, G. Özsoyoglu, Z. M. Özsoyoglu
{"title":"VISUAL: a graphical icon-based query language","authors":"N. H. Balkir, Eser Sükan, G. Özsoyoglu, Z. M. Özsoyoglu","doi":"10.1109/ICDE.1996.492203","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492203","url":null,"abstract":"VISUAL is a graphical icon-based query language designed for scientific databases where visualization of the relationships are important for the domain scientist to express queries. Graphical objects are not tied to the underlying formalism; instead, they represent the relationships of the application domain. VISUAL supports relational, nested, and object-oriented models naturally and has formal basis. In addition to set and bag constructs for complex objects, sequences are also supported by the data model. Concepts of external and internal queries are developed as modularization tools. A new parallel/distributed query processing paradigm is presented. VISUAL query processing techniques are also discussed.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123489595","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}
引用次数: 31
Prefetching from a broadcast disk 从广播磁盘预取
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492116
S. Acharya, Michael J. Franklin, S. Zdonik
{"title":"Prefetching from a broadcast disk","authors":"S. Acharya, Michael J. Franklin, S. Zdonik","doi":"10.1109/ICDE.1996.492116","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492116","url":null,"abstract":"Broadcast disks have been proposed as a means to efficiently deliver data to clients in \"asymmetric\" environments where the available bandwidth from the server to the clients greatly exceeds the bandwidth in the opposite direction. A previous study investigated the use of cost based caching to improve performance when clients access the broadcast in a demand driven manner (S. Acharya et al., 1995). Such demand driven access however, does not fully exploit the dissemination based nature of the broadcast, which is particularly conducive to client prefetching. With a broadcast disk, pages continually flow past the clients so that in contrast to traditional environments, prefetching can be performed without placing additional load on shared resources. We argue for the use of a simple prefetch heuristic called PT and show that PT balances the cache residency time of a data item with its bandwidth allocation. Because of this tradeoff, PT is very tolerant of variations in the broadcast program. We describe an implementable approximation for PT and examine its sensitivity to access probability estimation errors. The results show that the technique is effective even when the probability estimation is substantially different from the actual values.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114772276","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}
引用次数: 177
HiTi graph model of topographical road maps in navigation systems 导航系统中地形图的HiTi图形模型
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492091
Sungwon Jung, S. Pramanik
{"title":"HiTi graph model of topographical road maps in navigation systems","authors":"Sungwon Jung, S. Pramanik","doi":"10.1109/ICDE.1996.492091","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492091","url":null,"abstract":"In navigation systems, a primary task is to compute the minimum cost route from the current location to the destination. One of the major problems for navigation systems is that a significant amount of computation time is required to find a minimum cost path when the topographical road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. We propose a new graph model named HiTi (hierarchical multi graph model), for efficiently computing an optimal minimum cost path. Based on HiTi graph model, we propose a new single pair minimum cost path algorithm. We empirically show that our proposed algorithm performs far better than the traditional A* algorithm. Further, we empirically analyze our algorithm by varying both edge cost distribution and hierarchical level number of HiTi graphs.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124036799","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}
引用次数: 63
The Gold Text Indexing Engine 黄金文本索引引擎
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492103
Daniel Barbará, S. Mehrotra, Padmavathi Vallabhaneni
{"title":"The Gold Text Indexing Engine","authors":"Daniel Barbará, S. Mehrotra, Padmavathi Vallabhaneni","doi":"10.1109/ICDE.1996.492103","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492103","url":null,"abstract":"The proliferation of electronic communication including computer mail, faxes, voice mail, and net news has led to a variety of disjoint applications and usage paradigms that forces users to deal with multiple different user interfaces and access related information arriving over the different communication media separately. To enable users to cope with the overload of information arriving over heterogeneous communication media, we have developed the Gold document handling system that allows users to access all of these forms of communication at once, or to intermix them. The Gold system provides users with an integrated way to send and recieve messages using different media, efficiently store the messages, retrieve the messages based on their contents, and to access a variety of other sources of useful information. At the center of the Gold document handling system is the Gold Text Indexing Engine (GTIE) that provides a full text index over the documents. The paper describes our implementation of GTIE and the concurrency control protocols to ensure consistency of the index in the presence of concurrent operations.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131527370","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}
引用次数: 14
The Mentor project: steps towards enterprise-wide workflow management Mentor项目:实现企业范围工作流管理的步骤
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492206
Dirk Wodtke, Jeanine Weißenfels, G. Weikum, Angelika Kotz Dittrich
{"title":"The Mentor project: steps towards enterprise-wide workflow management","authors":"Dirk Wodtke, Jeanine Weißenfels, G. Weikum, Angelika Kotz Dittrich","doi":"10.1109/ICDE.1996.492206","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492206","url":null,"abstract":"Enterprise-wide workflow management where workflows may span multiple organizational units require particular consideration of scalability, heterogeneity, and availability issues. The Mentor project, introduced in this paper, aims to reconcile a rigorous workflow specification method with a distributed middleware architecture as a step towards enterprise-wide solutions. The project uses the formalism of state and activity charts and a commercial tool, Statemate, for workflow specification. A first prototype of Mentor has been built which allows executing specifications in a distributed manner. A major contribution of this paper is the method for transforming a centralized state chart specification into a form that is amenable to a distributed execution and to incorporate the necessary synchronization between different processing entities. Fault tolerance issues are addressed by coupling Mentor with the Tuxedo TP monitor.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128945555","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}
引用次数: 164
DSDT: Durable Scripts containing Database Transactions DSDT:包含数据库事务的持久脚本
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492213
B. Salzberg, Dimitri Tombroff
{"title":"DSDT: Durable Scripts containing Database Transactions","authors":"B. Salzberg, Dimitri Tombroff","doi":"10.1109/ICDE.1996.492213","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492213","url":null,"abstract":"DSDT is a proposed method for creating durable scripts which contain short ACID transactions as components. Workflow scripts are an example. The context of the script is made durable by writing a log record whenever an event occurs which cannot be replayed. Log checkpoints are used to minimize the recovery time. DSDT can be written in stand-alone mode, communicating with a DBMS by transactional remote procedure calls and maintaining its own logging system, or it can be made part of a DBMS by modifying the DBMS transaction manager source code. DSDT provides a panic button (signal-exit) and the ability to specify what action should be taken on restart after a system failure. The programmer can also specify actions, such as \"compensation\" transactions, to be taken after another signal (signal-cancel) arrives. DSDT enables most extended transaction models to be expressed in scripts modulo the guarantees of compensation. Recovery after system failure is shown to be correct.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130858210","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}
引用次数: 23
Data replication in Mariposa Mariposa中的数据复制
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492198
Jeff Sidell, Paul M. Aoki, Adam Sah, Carl Staelin, M. Stonebraker, A. Yu
{"title":"Data replication in Mariposa","authors":"Jeff Sidell, Paul M. Aoki, Adam Sah, Carl Staelin, M. Stonebraker, A. Yu","doi":"10.1109/ICDE.1996.492198","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492198","url":null,"abstract":"The Mariposa distributed data manager uses an economic model for managing the allocation of both storage objects and queries to servers. We present extensions to the economic model which support replica management, as well as our mechanisms for propagating updates among replicas. We show how our replica control mechanism can be used to provide consistent, although potentially stale, views of data across many machines without expensive per-transaction synchronization. We present a rule-based conflict resolution mechanism, which can be used to enhance traditional time-stamp serialization. We discuss the effects of our replica system on query processing for both read-only and read-write queries. We further demonstrate how the replication model and mechanisms naturally support name service in Mariposa.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133533457","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}
引用次数: 101
Automating the assembly of presentations from multimedia databases 自动组装来自多媒体数据库的演示文稿
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492210
G. Özsoyoglu, Veli Hakkoymaz, J. Kraft
{"title":"Automating the assembly of presentations from multimedia databases","authors":"G. Özsoyoglu, Veli Hakkoymaz, J. Kraft","doi":"10.1109/ICDE.1996.492210","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492210","url":null,"abstract":"A multimedia presentation refers to the presentation of multimedia data using output devices such as monitors for text and video, and speakers for audio. Each presentation consists of multimedia segments which are obtained from a multimedia data model. In this paper, we propose to express the semantic coherency of a multimedia presentation in terms of presentation inclusion and exclusion constraints that are incorporated into the multimedia data model. Thus, when a user specifies a set of segments for a presentation, the DBMS adds segments into and/or deletes segments from the set in order to satisfy the inclusion and exclusion constraints. To automate the assembly of a presentation with concurrent presentation streams, we also propose presentation organization constraints that are incorporated into the multimedia data model, independent of any presentation. We give two algorithms for automated presentation assembly and discuss their complexity. We discuss the satisfiability of inclusion and exclusion constraints when negation is allowed, and we briefly describe a prototype system that is being developed for automated presentation assembly.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708527","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}
引用次数: 35
A groupware benchmark based on Lotus Notes 基于Lotus Notes的群件基准测试
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492200
K. Moore, Michelle Peterson
{"title":"A groupware benchmark based on Lotus Notes","authors":"K. Moore, Michelle Peterson","doi":"10.1109/ICDE.1996.492200","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492200","url":null,"abstract":"We propose a new benchmark for groupware systems. It incorporates elements of previous messaging, text retrieval, and database benchmarks. The benchmark is based on groupware functions found in Lotus Notes, but should be adaptable by any groupware system.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133828456","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
下一页 尾页
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学术官方微信