By Topic

Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789)

18-20 Sept. 2000

Filter Results

Displaying Results 1 - 25 of 50
  • 2000 International Database Engineering and Applications Symposium [front matter]

    Publication Year: 2000, Page(s):0_1 - viii
    Request permission for commercial reuse | PDF file iconPDF (284 KB)
    Freely Available from IEEE
  • Business-to-business connectivity and emerging protocols for E-biz

    Publication Year: 2000, Page(s):3 - 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    Summary form only given. For many years ED1 served as the dominant protocol for e-biz over private networks. Due to the rapid spread of the Internet, several new Business-to-Business (B2B) interaction protocols have become popular, e.g., Open Buying on the Internet (OBI), RosettaNet, and Vendor-defined protocols such as Ariba??s Punchout process. We will describe these protocols, with an emphasis ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 2000, Page(s):447 - 448
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • Metadata based Web mining for relevance

    Publication Year: 2000, Page(s):113 - 121
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    This paper presents a relevant term discoverer, a system that discovers relevant topics of a given topic from the World Wide Web. The system mines hyperlink metadata on the basis of the association of terms in the metadata. It also applies various filtering techniques to detect false positives and false negatives. The applications of the system include: i) topic-specific information gathering syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mediated information gain

    Publication Year: 2000, Page(s):360 - 370
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    Deals with the problem of how to gain information from many heterogeneous data sources. As a solution, we propose a general framework for mediated information gain: it minimizes and supports the human burden, clearly identifies the algorithmically tractable subtasks and assures a well-understood level of quality. We identify a “mediation task” as an extended amalgamation of searching, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • StreamJoin: a generic database approach to support the class of stream-oriented applications

    Publication Year: 2000, Page(s):83 - 91
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records. Analysis of this data requires stream processing techniques which differ in significant ways from what current database analysis and query techniques have been optimized for. In this paper we present a new operator, cal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data caching for telephony services

    Publication Year: 2000, Page(s):101 - 109
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    We study client-server data caching, both with and without expiration timestamps, to assess its applicability to present and future telecommunications services such as local number portability, toll-free numbers, and mobile telephony. We perform simulation studies to evaluate the empirical performance of a variety of strategies for caching in a client-server setting. Data caching at client locatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrency control for B-trees with differential indices

    Publication Year: 2000, Page(s):287 - 295
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    We present an indexing system where a database index is divided into two parts: the main index located on disk and the differential index in the main memory. Both indices are implemented as B-trees. All updates performed by active transactions are written in the differential index. Periodically, writes of committed transactions are transferred from differential index to the main index as a batch-u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of RapidBase-an active measurement database system

    Publication Year: 2000, Page(s):75 - 82
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    In data-intensive industrial on-line applications utilizing live process data, one faces an unusual set of database requirements. The process measurement data need to be acquired at great speed, organized in time series and made available for time-based retrieval. Active capabilities and functional extensibility are needed to implement a flexible data-driven processing paradigm. An efficient trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XML functionally

    Publication Year: 2000, Page(s):266 - 274
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    The topic of the XML language is one of the most discussed in the IS/IT community today. The primary goal of XML is to provide marking text components and use such data for exchange among information sources. The goal of the paper is to present a database view on XML data. We formulate a type system powerful enough to describe XML data in a set- and function-oriented manner. A version of a typed &... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting data migration between relational and object-oriented databases using a federation approach

    Publication Year: 2000, Page(s):371 - 379
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Data migration between relational and object-oriented database systems is useful whenever relational data is needed in new object-oriented environments. However, implementing migration programs, i.e. converting and loading legacy data into the new database system, is cumbersome and must be done for each pair of databases manually. This paper presents a flexible approach to support data exchange us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to reuse former queries to facilitate the formulation of new ones

    Publication Year: 2000, Page(s):92 - 100
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    Query formulation remains obstinately difficult for large classes of users. Indeed, in face of the growth in query complexity due to development of new kind of application manipulating great size of data, we notice the absence of models taking charge of the user through from specification of needs to formulation of queries. We think that users can be given effective help in query formulation by me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Open active services for data-intensive distributed applications

    Publication Year: 2000, Page(s):349 - 359
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB)

    Applications are now highly distributed, heterogeneous and scalable. They comprise autonomous, loosely coupled components, some of them being database management systems, Web servers, etc. Considering such a framework, database technology has to evolve towards cooperation and integration. We propose open and distributed active services that can be used for specifying and generating event and rule ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of MBR-based spatial access methods: how well they perform in high-dimensional spaces

    Publication Year: 2000, Page(s):306 - 315
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Many spatial applications deal with data characterized by extremely high dimensionality. Unfortunately, other than the fact that contemporary spatial access methods (SAMs) are inadequate to handle large sets of high dimensional data, we know little about the underlying causes of their inadequacy. The paper investigates the performance of spatial access methods that approximate extended objects by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying databases with knowledge domains

    Publication Year: 2000, Page(s):65 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    We assume that data domains are associated with a set of user-defined predicates, which we call knowledge domains and tackle the following problem: given a database equipped with knowledge domains, what exactly the set of relations can possibly be retrieved by a query? First, we extend the RA to the Knowledge Relational Algebra (the KRA) by allowing predicates to be used in formulae of the selecti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy functional dependency and its application to approximate data querying

    Publication Year: 2000, Page(s):47 - 54
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Reviews a new definition of fuzzy functional dependency based on conditional probability and its application to approximate data reduction related to the operation of projection in classical relational databases in order to construct fuzzy integrity constraints. We introduce the concept of partial fuzzy functional dependency, which expresses the fact that a given attribute X does not determine Y c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient maintenance of temporal data warehouses

    Publication Year: 2000, Page(s):188 - 196
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    A temporal data warehouse can be defined as a set V of materialized views over non-temporal sources. We present a self-maintainable temporal data warehouse that, besides a set of temporal views V, has two kinds of auxiliary views: a set T of auxiliary relations containing only temporal information necessary to maintain the data warehouse and a set C of complements allowing the warehouse maintenanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study on the interaction between interscheme property extraction and type conflict resolution

    Publication Year: 2000, Page(s):25 - 33
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    Studies the interaction between the extraction of heterogeneous database inter-scheme properties, such as synonymies, homonymies and type conflicts (which are exploited for defining the semantics of the involved schemes for integration purposes), and the resolution of type conflicts. As a matter of fact, the transformations required by type conflict resolution could invalidate some of the detected... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Materializing a set of views: dynamic strategies and performance evaluation

    Publication Year: 2000, Page(s):424 - 428
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    The present paper focuses on a view selection method exploiting a central construct called Multi View Materialization Graph (MVMG) which provides a framework to support materialized, virtual and hybrid fragments of views. Furthermore, our approach is dynamic, i.e. materialized fragments can become virtual and vice versa. In the same way, attributes may change their status according to their update... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of definite, indefinite and infinite temporal information

    Publication Year: 2000, Page(s):167 - 175
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    An information system is used for representing and managing indicative information from multiple sources describing the state of an enterprise. Most information systems model enterprises that are crisp. A crisp enterprise is one that is highly quantifiable; relationships are fixed and attributes are atomic valued. The premises for this paper are precise enterprises, where data are imperfect and mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An XML-based architecture for adaptive Web hypermedia systems using a probabilistic user model

    Publication Year: 2000, Page(s):257 - 265
    Cited by:  Papers (5)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Web based hypermedia systems are becoming increasingly popular as tools for user driven access to information and services. The paper presents an architecture for the development of Web based adaptive hypermedia systems. The architecture uses weighted graphs of XML documents to describe the application domain and a probabilistic model to adapt the Web site content generation and presentation to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling hypermedia videos in multimedia database systems coupled with realtime media servers

    Publication Year: 2000, Page(s):327 - 336
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The integrated management of standard structured data and time-dependent data is still too complex to be covered by a single system. So, there will be distinct systems such as multimedia DBMS and media servers for e.g., video data, each doing only what it can do best. However, some functions desired by users and applications necessarily involve both systems. A prime candidate for this is the use o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic performance optimization mechanism for parallel object-oriented database programming languages

    Publication Year: 2000, Page(s):405 - 409
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    Discusses dynamic performance optimization mechanisms for parallel object-oriented database programming languages. When a large number of objects are distributed on a distributed-memory parallel processor, referencing a remote object requires inter-processor communication. If those objects are not allocated properly, it may cause total performance degradation. When those objects are allocated with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query result size estimation using the Trapezoidal Attribute Cardinality Map

    Publication Year: 2000, Page(s):236 - 242
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    Histogram techniques are used to efficiently estimate query result sizes in most of the modern-day database systems. In a recent work (Oommen and Thiyagarajah, 1999), we introduced a new histogram-like approximation strategy, called the Rectangular Attribute Cardinality Map (R-ACM), which approximates the density function within a given sector by a rectangular cell. In this paper, we introduce ano... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formal background to build constraint objects

    Publication Year: 2000, Page(s):7 - 15
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Constraint databases exploit a fundamental duality: (i) a constraint (first-order formula) with free variables is interpreted as a set of database tuples that satisfy it; (ii) conversely, a database object can be viewed as a constraint. This enables us to use constraints as basic data types in the underlying DBMS and to enjoy the expressiveness of first-order logic and most of the advantages of co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.