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
  • Processing operations with restrictions in RDBMS without external sorting: the Tetris algorithm

    Publication Year: 1999, Page(s):562 - 571
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (212 KB)

    Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient access to a table in some sort order. In principle, indexes could be used, but they are superior to a full table scan only if the result set is sufficiently restricted in the index attribute. We present the Tetris algorith... 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 (17)
    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.
  • Working together in Harmony-an implementation of the CORBA object query service and its evaluation

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

    The CORBA standard, together with its service specifications, has gained considerable attention in recent years. The CORBA Object Query Service allows for declarative access to heterogeneous storage systems. We have come up with an implementation of this service called Harmony. The objective of the article is to provide a detailed description and quantitative assessment of Harmony. Its main techni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query routing in large-scale digital library systems

    Publication Year: 1999, Page(s):154 - 163
    Cited by:  Papers (1)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (280 KB)

    Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. The increasing volume and diversity of digital information available online have led to a growing problem that conventional data management systems do not have, namely finding which information sources out of many candidate choices are t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining data cubes under dimension updates

    Publication Year: 1999, Page(s):346 - 355
    Cited by:  Papers (25)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (304 KB)

    OLAP systems support data analysis through a multidimensional data model, according to which data facts are viewed as points in a space of application-related “dimensions”, organized into levels which conform to a hierarchy. The usual assumption is that the data points reflect the dynamic aspect of the data warehouse, while dimensions are relatively static. However, in practice, dimens... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tape-disk join strategies under disk contention

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

    Large-scale data warehousing, data mining and scientific applications require the analysis of terabytes of factual data accumulated over long periods of time. Tape libraries are suitable for storing such mass data. The online analytical processing (OLAP) of this data typically leads to long-running aggregation queries joining the tape-resident fact relations with disk-resident dimension relations.... 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 (46)  |  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.
  • STING+: an approach to active spatial data mining

    Publication Year: 1999, Page(s):116 - 125
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (176 KB)

    Spatial data mining presents new challenges due to the large size of spatial data, the complexity of spatial data types, and the special nature of spatial access methods. Most research in this area has focused on efficient query processing of static data. This paper introduces an active spatial data mining approach which extends the current spatial data mining algorithms to efficiently support use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A database approach for modeling and querying video data

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

    Indexing video data is essential for providing content based access. We consider how database technology can offer an integrated framework for modeling and querying video data. We develop a data model and a rule-based query language for video content based indexing and retrieval. The data model is designed around the object and constraint paradigms. A video sequence is split into a set of fragment... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile agents for WWW distributed database access

    Publication Year: 1999, Page(s):228 - 237
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (368 KB)

    The popularity of the Web as a universal access mechanism for network information has created the need for developing Web based DBMS client/server applications. However, the current commercial applet based methodologies for accessing database systems offer limited flexibility, scalability and robustness. We propose a new framework for Web based distributed access to database systems based on Java ... 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.
  • Multidimensional data modeling for complex data

    Publication Year: 1999, Page(s):336 - 345
    Cited by:  Papers (23)  |  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.
  • Improving the access time performance of serpentine tape drives

    Publication Year: 1999, Page(s):542 - 551
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (240 KB)

    The paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. We propose a new scheduling algorithm, Multi-Pass Scan Star (MPScan*), which makes good utilization of the streaming capability of the tape drive and avoids the pitfalls of naive multi-pass scan algorithms and greedy algori... 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.
  • Optimizer and parallel engine extensions for handling expensive methods based on large objects

    Publication Year: 1999, Page(s):304 - 313
    Cited by:  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (332 KB)

    Object-relational database systems allow users to define new types and functions. This typing extension allows structural semantics to be applied to new data types (non-SQL92 data types). However, defining new, large, complex objects within a tuple is not always practical. Practicality alone requires that large object data structures be used. This implies that predicate evaluation can be performed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transparent replication of HTTP service

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

    We developed Web++, a prototype system based on user-transparent geographic replication which aims at improving the response time and the reliability of the HTTP service. Web++ extends the current Web client/server architecture with additional capabilities. The extension is provided via Java servlets at the server side and applets at the client side. The servlets pre-process the requested document... View full abstract»

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