By Topic

Data Engineering, 1999. Proceedings., 15th International Conference on

Date 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.
  • 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.
  • Author index

    Publication Year: 1999, Page(s):646 - 648
    Request permission for commercial reuse | PDF file iconPDF (372 KB)
    Freely Available from IEEE
  • An agent-based approach to extending the native active capability of relational database systems

    Publication Year: 1999, Page(s):384 - 391
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1452 KB)

    Event-condition-action (or ECA) rules are used to capture active capability. While a number of research prototypes of active database systems have been built, ECA rule capability in relational DBMSs is still very limited. We address the problem of turning a traditional database management system into a full-fledged active database system without changing the underlying system. The advantages of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining optimized support rules for numeric attributes

    Publication Year: 1999, Page(s):206 - 215
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    Generalizes the optimized support association rule problem by permitting rules to contain disjunctions over uninstantiated numeric attributes. For rules containing a single numeric attribute, we present a dynamic programming algorithm for computing optimized association rules. Furthermore, we propose a bucketing technique for reducing the input size, and a divide-and-conquer strategy that improves... 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 (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (12 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.
  • Efficient time series matching by wavelets

    Publication Year: 1999, Page(s):126 - 133
    Cited by:  Papers (84)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are applied to time series to reduce the number of dimensions of the feature vectors. Different transformations like Discrete Fourier Transform (DFT) Discrete Wavelet Transform (DWT), Karhunen-Loeve (KL) transform or Singular... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ad hoc OLAP: expression and evaluation

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

    Users frequently formulate complex data analysis queries in order to identify interesting trends, make unusual patterns stand out, or verify hypotheses. Being able to express these data mining queries concisely is of major importance not only from the user's, but also from the system's point of view. Recent research in OLAP has focused on datacubes and their applications; however expression and pr... 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 (92 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.
  • Integrating light-weight workflow management systems within existing business environments

    Publication Year: 1999, Page(s):286 - 293
    Cited by:  Papers (6)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1868 KB)

    Workflow management systems (WfMSs) support the efficient, largely automated execution of business processes. However, using a WfMS typically requires implementing the application's control flow exclusively by the WfMS. This approach is powerful if the control flow is specified and implemented from scratch, but it has severe drawbacks if a WfMS is to be integrated within environments with existing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The ECHO method: concurrency control method for a large-scale distributed database

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

    When constructing a large-scale database system, data replication is useful to give users efficient access to that data. However for databases with a very large number of replica sites, using traditional networking concurrency control protocols makes communication too costly for practical use. In this paper we propose a new protocol called ECHO for concurrency control of replica data distributed o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • 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.
  • Multiversion reconciliation for mobile databases

    Publication Year: 1999, Page(s):582 - 589
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    As mobile computing devices become more and more popular mobile databases have started gaining popularity. An important feature of these database systems is their ability to allow optimistic replication of data by permitting disconnected mobile devices to perform local updates on replicated data. The fundamental problem in this approach is the reconciliation problem, i.e. the problem of serializin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating heterogeneous OO schemas

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

    To eliminate semantic conflicts among the heterogeneous databases involved in a cooperation, a set of correspondence assertions for declaring their semantic relationships have to be constructed by DBAs or by users. Normally, four set relationships between object classes: equivalence, inclusion, intersection, and exclusion will be defined to provide knowledge about correspondences that exist among ... 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.
  • Scalable web server design for distributed data management

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

    With the explosive popularity of the internet and the world wide web (WWW), there is a rapidly growing need to provide unprecedented access to globally distributed data sources through the internet. Web accessibility will be an essential component of the services that future digital libraries should provide for clients. This need has created a strong demand for database access capability through t... 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.
  • Scalable trigger processing

    Publication Year: 1999, Page(s):266 - 275
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Current database trigger systems have extremely limited scalability. This paper proposes a way to develop a truly scalable trigger system. Scalability to large numbers of triggers is achieved with a trigger cache to use the main memory effectively, and a memory-conserving selection predicate index based on the use of unique expression formats called expression signatures. A key observation is that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On getting some answers quickly, and perhaps more later

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

    Traditionally, the answer to a database query is construed to be the set of all tuples that meet the criteria stated. Strict adherence to this notion in query evaluation is, however, increasingly unsatisfactory, because decision makers are more prone to adopting an exploratory strategy for information searching, which we call “getting some answers quickly, and perhaps more later”. In t... 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.
  • 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.
  • Maintaining data cubes under dimension updates

    Publication Year: 1999, Page(s):346 - 355
    Cited by:  Papers (11)  |  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.
  • 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.