Notice
There is currently an issue with the citation download feature. Learn more

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)

23-26 March 1999

Filter Results

Displaying Results 1 - 25 of 92
  • Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (412 KB)
    Freely Available from IEEE
  • Que Sera, Sera: The Coincidental Confluence of Economics, Business, and Collaborative Computing

    Publication Year: 1999, Page(s):2 - 3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Summary form only given. This presentation is an exploration of the next generation computing based on the confluence of radical and coincidental changes in economics, business, and technology. Whereas technology is a key enabler of change, it is and is the servant, not the master. Without a depth of understanding of this enabling role and the content in which technology serves, technology can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database as an application integration platform

    Publication Year: 1999
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (37 KB)

    Summary form only given as follows. This paper describes critical features that should be provided by any platform for application integration. These features include message queuing, message filtering and data transformation. The integration of these features with a database makes for a powerful platform for application integration that is scalable, reliable, available and manageable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Business objects and application integration

    Publication Year: 1999
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (54 KB)

    Summary form only given as follows. Application integration addresses the need for diverse applications to be able to communicate with each other across application boundaries and across platform boundaries. Business objects extend the type system of relational databases to deal with the needs of application integration. The requirements of business application integration include event-based info... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Policies in a resource manager of workflow systems: modeling, enforcement and management

    Publication Year: 1999
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    Summary form only given. We are interested in Workflow Management Systems (WFMS), and particularly, in Resource Management (RM) of WFMS. A WFMS consists of coordinating executions of multiple activities, instructing who (resource) do what (activity) and when. The "when" part is taken care of by the workflow engine which orders the executions of activities based on a process definition. The "who" p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Mining from an Al Perspective

    Publication Year: 1999, Page(s): 186
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (75 KB)

    Summary form only given, as follows. Data Mining, or Knowledge Discovery in Databases as it is also called, is claimed as an offspring by three disciplines: databases, statistics, and the machine learning subfield of artificial intelligence. (The term originated in statistics with distinctly pejorative overtones - data mining was characterized as fossicking in data without a guiding model.) Statis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast approximate query answering using precomputed statistics

    Publication Year: 1999
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (10 KB)

    Summary form only given. The last few years have witnessed a significant increase in the use of databases for complex data analysis (OLAP) applications. These applications often require very quick responses from the DBMS. However, they also involve complex queries on large volumes of data. Despite significant improvement in database support for OLAP over the last few years, most DBMSs still fall s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data warehouse maintenance under concurrent schema and data updates

    Publication Year: 1999
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (87 KB)

    Summary form only given. Data warehouses (DW) are built by gathering information from several information sources (IS) and integrating it into one repository customized to users' needs. ISs are typically owned by different information providers and hence are independent and autonomous. This implies they will update their data and schemas independently and without any concern for how this may affec... View full abstract»

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

    Publication Year: 1999, Page(s):646 - 648
    Request permission for commercial reuse | PDF file iconPDF (372 KB)
    Freely Available from IEEE
  • Storage of multidimensional arrays based on arbitrary tiling

    Publication Year: 1999, Page(s):480 - 489
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    Storage management of multidimensional arrays aims at supporting the array model needed by applications and insuring fast execution of access operations. Current approaches to store multidimensional arrays rely on partitioning data into chunks (equally sized subarrays). Regular partitioning however, does not adapt to access patterns, leading to suboptimal access performance. We propose a storage a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable classification over SQL databases

    Publication Year: 1999, Page(s):470 - 479
    Cited by:  Papers (4)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    We identify data-intensive operations that are common to classifiers and develop a middleware that decomposes and schedules these operations efficiently using a backend SQL database. Our approach has the added advantage of not requiring any specialized physical data organization. We demonstrate the scalability characteristics of our enhanced client with experiments on Microsoft SQL Server 7.0 by v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time data access control on B-tree index structures

    Publication Year: 1999, Page(s):458 - 467
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    The paper proposes methodologies to control the access of B-tree-indexed data in a batch and real time fashion. Algorithms are proposed to insert, query, delete, and rebalance B-tree-indexed data based on non real time algorithms (P.M. Kerttu et al., 1996) and the idea of priority inheritance (L. Sha et al., 1990). We propose methodologies to reduce the number of disk I/Os to improve the system pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexing constraint databases by using a dual representation

    Publication Year: 1999, Page(s):618 - 627
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    Linear constraint databases are a powerful framework to model spatial and temporal data. The use of constraint databases should be supported by access data structures that make effective use of secondary storage and reduce query processing time. Such structures should be able to store both finite and infinite objects and perform both containment (ALL) and intersection (EXIST) queries. As standard ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fat-Btree: an update-conscious parallel directory structure

    Publication Year: 1999, Page(s):448 - 457
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    We propose a parallel directory structure, Fat-Btree, to improve high speed access for parallel database systems in shared nothing environments. The Fat-Btree has a threefold aim: to provide an indexing mechanism for fast retrieval in each processor; to balance the amount of data among distributed disks, and to reduce synchronization costs between processors during update operations. We use a prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data integration by describing sources with constraint databases

    Publication Year: 1999, Page(s):374 - 381
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of constraint database techniques. We assume the existence of a global database schema. The contents of each data source are described using a set of constraint tuples over the global schema; each such tuple indicates possi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal semantics of composite events for distributed environments

    Publication Year: 1999, Page(s):400 - 407
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    Languages for event specification in centralized systems and their semantics have received considerable attention in the literature. In contrast, very little work exists on extending the semantics of event specification languages to distributed environments. The paper provides a well-defined notion of distributed composite time stamps and their least restricted strict ordering are defined. The ord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concentric hyperspaces and disk allocation for fast parallel range searching

    Publication Year: 1999, Page(s):608 - 615
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    Data partitioning and declustering have been extensively used in the past to parallelize I/O for range queries. Numerous declustering and disk allocation techniques have been proposed in the literature. However most of these techniques were primarily designed for two-dimensional data and for balanced partitioning of the data space. As databases increasingly integrate multimedia information in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The hybrid tree: an index structure for high dimensional feature spaces

    Publication Year: 1999, Page(s):440 - 447
    Cited by:  Papers (45)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    Feature-based similarity searching is emerging as an important search paradigm in database systems. The technique used is to map the data items as points into a high-dimensional feature space which is indexed using a multidimensional data structure. Similarity searching then corresponds to a range search over the data structure. Although several data structures have been proposed for feature index... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heterogeneous query processing through SQL table functions

    Publication Year: 1999, Page(s):366 - 373
    Cited by:  Papers (5)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    In today's IT infrastructures, data is stored in SQL databases, non-SQL, databases, and host databases like ISAM/VSAM files. Non-SQL databases are specialized data stores controlled by applications like spreadsheets, mail, directory and index services. Developing applications accessing a variety of different data sources is challenging for application developers due to different environments, APIs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speeding up heterogeneous data access by converting and pushing down string comparisons

    Publication Year: 1999
    Cited by:  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (40 KB)

    Pushing down predicates to an external data source is critical to the performance for querying heterogeneous data sources. However, predicate-containing string comparisons cannot be pushed down unchanged if the external data source uses a different collating sequence. We describe a table-driven technique for rewriting such predicates to account for the differences in collation. In addition to prec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional data modeling for complex data

    Publication Year: 1999, Page(s):336 - 345
    Cited by:  Papers (22)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    Online Analytical Processing (OLAP) systems considerably ease the process of analyzing business data and have become widely used in industry. Such systems primarily employ multidimensional data models to structure their data. However current multidimensional data models fall short in their abilities to model the complex data found in some real world application domains. The paper presents nine req... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the usefulness of search engines

    Publication Year: 1999, Page(s):146 - 153
    Cited by:  Papers (9)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    In this paper, we present a statistical method to estimate the usefulness of a search engine for any given query. The estimates can be used by a metasearch engine to choose local search engines to invoke. For a given query, the usefulness of a search engine in this paper is defined to be a combination of the number of documents in the search engine that are sufficiently similar to the query and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Atomic commitment in database systems over active networks

    Publication Year: 1999
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Traditional communication networks have functioned only to deliver information packets from one end system to another. As the cost of computing power continues to decrease, it is worthwhile to consider the benefits of adding more of that computing power to the network itself, either to enhance services or to trade off against other costs such as time, bandwidth and storage. This new area of resear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Raster-spatial data declustering revisited: an interactive navigation perspective

    Publication Year: 1999, Page(s):600 - 607
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Various declustering techniques have been proposed in the literature for raster-geospatial data. Their primary focus is on reducing response time for static range queries. We focus on interactive navigation queries, which exhibit a new class of data access patterns. We analyze and compare the performance of three well-known declustering schemes: Disk Modulo, Exclusive-OR, and Hilbert Curve Access ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal temporal extensions for database languages

    Publication Year: 1999, Page(s):428 - 437
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    Temporal reasoning and temporal query languages present difficult research problems of theoretical interest and practical importance. One problem is the chasm between point-based temporal reasoning and interval-based reasoning. Another problem is the lack of robustness and universality in many proposed solutions, whereby temporal extensions designed for one language cannot be easily applied to oth... View full abstract»

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