Proceedings 12th Australasian Database Conference. ADC 2001

Jan. 29 2001-Feb. 1 2001

Filter Results

Displaying Results 1 - 24 of 24
  • Proceedings 12th Australasian Database Conference. ADC 2001

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (145 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s): 176
    Request permission for commercial reuse | PDF file iconPDF (41 KB)
    Freely Available from IEEE
  • Design theory for advanced datamodels

    Publication Year: 2001, Page(s):3 - 9
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    Argues in favour of a design theory for advanced data models, such as object-oriented models. We start from basic design desiderata for databases, independent from the underlying data model. The basis of our investigation is a generic object-oriented data model (OODM), for which all common data models can be considered as special cases. Then we approach a unification and generalization of dependen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity-based algebra for multimedia database systems

    Publication Year: 2001, Page(s):115 - 122
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB) | HTML iconHTML

    In database management systems, the need to integrate content-based image retrieval facilities has become one of the key issues. We first illustrate the importance of such facilities with example queries and give an overview of the work done in similarity-based data retrieval. Then, we propose an image repository model that supports similarity-based operations on feature vector representations of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring similarity of interests for clustering Web-users

    Publication Year: 2001, Page(s):107 - 114
    Cited by:  Papers (11)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    There has been an increased demand for understanding of Web-users due to the Web development and the increased number of Web-based applications. Informative knowledge extracted from Web user access patterns has been used for many applications, such as the prefetching of pages between clients and proxies. This paper presents an approach for measuring similarity of interests among Web users, based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-maintaining Web pages-an overview

    Publication Year: 2001, Page(s):83 - 90
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB) | HTML iconHTML

    Data-intensive Web-based information systems usually employ database systems to store the contents forming the basis for Web page construction. Generating Web pages on the fly, especially in peak times, can lead to severe performance problems. Thus, pre-generation of Web pages has been suggested to be ready for prime time, allowing to reliably deliver several hundred pre-generated pages per second... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying Web distributed databases for XML-based e-businesses: requirement analysis, design, and implementation

    Publication Year: 2001, Page(s):60 - 67
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    Electronic commerce (EC) business models like e-brokers on the Web use XML databases such as product and customer data. To flexibly model such applications, we need a modeling language for EC businesses, that is, business processes. To this end, we have adopted a query language approach to modeling and have designed a query language for distributed XML databases called XBML suitable for EC busines... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a temporal World-Wide Web: a transaction-time server

    Publication Year: 2001, Page(s):169 - 175
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB) | HTML iconHTML

    Transaction time is the time of a database transaction, i.e., an insertion, update, or deletion. A transaction time database stores the transaction-time history of a database and supports transaction timeslice queries that retrieve past database states. The paper introduces transaction time to the World-Wide Web. In a Web context, transaction time is the modification time of a resource such as an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for answering queries efficiently using views

    Publication Year: 2001, Page(s):99 - 106
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB) | HTML iconHTML

    Algorithms for answering queries using views have been used in query planning in order to answer queries posed to knowledge bases, databases, and information systems. However, these algorithms do not scale well when the number of views increases. Three known algorithms, the bucket algorithm, the inverse-rules algorithm and an algorithm suggested by Leser (1998) have been used to rewrite queries us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derivation of incremental equations for nested relations

    Publication Year: 2001, Page(s):76 - 82
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    Incremental equations form an important method for incrementally maintaining materialized views. We derive incremental equations for the general nested relational model, a data model in which incremental equations have not been derived to the best of our knowledge and a data model which is used in warehouses and in XML data. We derive incremental equations based on two types of nested relational a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • View updates in a semantic data modelling paradigm

    Publication Year: 2001, Page(s):29 - 36
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    The Sketch Data Model (SkDM) is a new semantic modelling paradigm based on category theory (specifically on categorical universal algebra), which has been used successfully in several consultancies with major Australian companies. This paper describes the SkDM and investigates the view update problem (VUP) in the SkDM paradigm. It proposes an approach to the VUP in the SkDM, and presents a range o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Are two pictures better than one?

    Publication Year: 2001, Page(s):138 - 144
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    A major hurdle in practical content based image retrieval (CBIR) is conveying the user's information need to the system. One common method of query specification is to express the query using one or more example images. The authors consider whether using more examples improves the effectiveness of CBIR in meeting a user's information need. We show that using multiple examples improves retrieval ef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the unification of query algebras and their extension to rational tree structures

    Publication Year: 2001, Page(s):52 - 59
    Cited by:  Papers (3)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB) | HTML iconHTML

    In order to come to a unification of existing query algebras, especially for object bases, it is necessary to understand the semantic differences between different data models and associated query algebras. It is argued that all existing query algebras can be expressed by the operations provided by an underlying type system plus a single join-operator. This is still true, if rational tree types ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolution support in large-scale interoperable systems: a metadata driven approach

    Publication Year: 2001, Page(s):161 - 168
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB) | HTML iconHTML

    One of the fundamental difficulties associated with large-scale database interoperation is the cost and effort required for maintaining the federation in a consistent state after its launch. If only human intervention is to be assumed, the task of maintaining logical federation consistency becomes insurmountable as the scale increases. The need for research towards a federation evolution model whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental maintenance of multi-source views

    Publication Year: 2001, Page(s):13 - 20
    Cited by:  Papers (1)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB) | HTML iconHTML

    In recent years, numerous algorithms have been proposed for incremental view maintenance of data warehouses. As a matter of fact, all of them follow almost the same general approach, namely they compute the change of a multi-source view in response to an update message from a data source, following two steps: (i) issue a set of queries against the other data sources, and (ii) compensate the query ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent-based approach for supporting cross-enterprise workflows

    Publication Year: 2001, Page(s):123 - 130
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB) | HTML iconHTML

    In order to support global competitiveness and rapid market responsiveness, virtual enterprises need to efficiently integrate different organization's workflows to provide customized services. Currently, most of the integrations are case based which have high setup cost and involve time consuming low level programming. Cross-enterprise workflow that is able to streamline and coordinate business pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient declustering techniques for temporal access structures

    Publication Year: 2001, Page(s):91 - 98
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    We address the problem of declustering temporal data and access structures for parallel architectures consisting of a single processor and multiple disks. To illustrate our techniques we choose the multi-version access structure. We propose two new, efficient techniques called T-proximity and KT-proximity for assigning the data and index nodes of the multiversion access structure to multiple disks... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective compression for the Web: exploiting document linkages

    Publication Year: 2001, Page(s):68 - 75
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB) | HTML iconHTML

    Providing the infrastructure that supports the World Wide Web is expensive. The costs incurred in running a Web site include those associated with the content being served, those associated with the hardware that supports the site; and the network costs incurred in transmitting that content to the end consumers. In this work we examine mechanisms for compressing Web content so as to reduce the thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A subsequence matching algorithm supporting moving average transform of arbitrary order in time-series databases using index interpolation

    Publication Year: 2001, Page(s):37 - 44
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    Proposes a subsequence matching algorithm that supports a moving-average transform of arbitrary order in time-series databases. The existing subsequence matching algorithm of C. Faloutsos et al. (1994) requires an index for each moving-average order, which causes serious storage and CPU time overheads. In this paper, we solve the problem using index interpolation. The proposed algorithm can use on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic algorithms for I/O scheduling for efficient retrieval of large objects from tertiary storage

    Publication Year: 2001, Page(s):145 - 152
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    Multimedia data service applications of today are to efficiently deal with a possibly massive amount of large objects (LOBs). The storage capacity of the traditional disk-based DBMS is certainly limited to support such applications. As such, it is necessary for the DBMS to employ tertiary storage devices, which perform often with long latency and yet can provide a huge amount of storage capacity a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Describing capabilities of Internet data sources for information discovery and sharing

    Publication Year: 2001, Page(s):21 - 28
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB) | HTML iconHTML

    The Internet now makes it possible for people to build complex applications by combining the data and processes offered by different information systems that are available across the network. These data sources normally have very diverse data structures and processing capabilities. In order for these systems to share information and to collaborate with each other, they must be able to present thei... View full abstract»

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

    Publication Year: 2001, Page(s):131 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB) | HTML iconHTML

    We discuss how to post-evaluate inductive classification based on user belief. Although we could learn classification rules inductively by means of decision tree generation, we wonder whether it is consistent with our utilization or not. In the investigation we discuss how to obtain assessment of learning results by verifying belief. Our idea is based on a decision tree with hierarchy to class and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parameterised algorithm for mining association rules

    Publication Year: 2001, Page(s):45 - 51
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB) | HTML iconHTML

    A central part of many algorithms for mining association rules in large data sets is a procedure that finds so called frequent itemsets. This paper proposes a new approach to finding frequent itemsets. The approach reduces a number of passes through an input data set and generalises a number of strategies proposed so far. The idea is to analyse a variable number n of itemset lattice levels in p sc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of multi-level concurrency control protocols

    Publication Year: 2001, Page(s):153 - 160
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB) | HTML iconHTML

    Locking protocols for multi-level transactions have been studied since the very beginning. More recently, a hybrid concurrency control protocol for multi-level transactions called FoPL has been developed. It employs access lists on the database objects and forward oriented commit validation. The basic test on all levels is based on the reordering of the access lists. So far, a detailed analysis of... View full abstract»

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