By Topic

Database Conference, 2000. ADC 2000. Proceedings. 11th Australasian

Date Jan. 31 2000-Feb. 3 2000

Filter Results

Displaying Results 1 - 23 of 23
  • Proceedings 11th Australasian Database Conference. ADC 2000 (Cat. No.PR00528)

    Publication Year: 2000
    Request Permissions | PDF file iconPDF (122 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2000 , Page(s): 149
    Request Permissions | PDF file iconPDF (2 KB)  
    Freely Available from IEEE
  • Querying recursive structures without recursive queries

    Publication Year: 2000 , Page(s): 21 - 27
    Request Permissions | Click to expandAbstract | PDF file iconPDF (92 KB)  

    In this paper we present generic database model tools for L-systems (DBM-L). DBM-L allows representation of L-Systems objects as database structures by a generic automatic translation process. This research contributes the idea of pre-computing recursive structures data into derived attributes using compiler generation. In this paper we supplied a method to allow a correspondence biologist's terms... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A semi-structured object model with relations

    Publication Year: 2000 , Page(s): 99 - 106
    Cited by:  Patents (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (112 KB)  

    This paper introduces a semi-structured object model based on a weak notion of object classes, named categories. In our model, a category holds common properties of a set of objects. An object in our model may have features of its own, not abstracted in the category to which they belong; hence the semi-structured nature of the model. This feature of the model is very useful in domains where object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic verification of temporal constraints in production workflows

    Publication Year: 2000 , Page(s): 74 - 81
    Cited by:  Papers (20)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (80 KB)  

    Primitive support for time management has been recognised as one of the most significant limitations of today's workflows. In this paper, we propose a new temporal model for production workflows. After introducing basic features of the temporal model, we describe two time visualisation concepts: the duration space and the instantiation space that are used respectively for representation of relativ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Credible research: case studies from information retrieval

    Publication Year: 2000 , Page(s): 3
    Request Permissions | Click to expandAbstract | PDF file iconPDF (12 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ω-storage: a self organizing multi-attribute storage technique for very large main memories

    Publication Year: 2000 , Page(s): 57 - 64
    Request Permissions | Click to expandAbstract | PDF file iconPDF (100 KB)  

    Main memory storage is continuously improving, both in its price and its capacity. With this comes new storage problems and new directions of possible usage. Several main-memory database systems are now becoming commercially available. The hot areas for their deployment include boosting the performance of Web-enabled systems, such as search engines, and electronic auctioning systems. We present a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending iterators for advanced query execution

    Publication Year: 2000 , Page(s): 135 - 139
    Request Permissions | Click to expandAbstract | PDF file iconPDF (40 KB)  

    Today's commercial relational database systems use tree-shaped execution plans. The evaluation techniques for these plan are well understood and have been refined over the last decade. However, for queries that contain disjunctive predicates, using the more general class of direct acyclic graphs and splitting data streams can be beneficial. Unfortunately, the iterator based evaluation techniques u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A compression scheme for large databases

    Publication Year: 2000 , Page(s): 6 - 11
    Cited by:  Papers (1)  |  Patents (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (52 KB)  

    Compression of databases not only reduces space requirements but can also reduce overall retrieval times. We have described elsewhere our RAY algorithm for compressing databases containing general-purpose data, such as images, sound, and also text. We describe here an extension to the RAY compression algorithm that permits use on very large databases. In this approach, we build a model based on a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient range query retrieval for non-uniform data distributions

    Publication Year: 2000 , Page(s): 90 - 98
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (116 KB)  

    Answering range queries is a common database operation. Methods based on hashing techniques to minimise the cost of answering range queries by taking the query distribution into account have previously been proposed. These methods have all assumed a uniform distribution of data to disk pages to achieve good performance. This assumption makes them less useful in practice because most real data dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handling dynamic schema change in process models

    Publication Year: 2000 , Page(s): 120 - 126
    Cited by:  Papers (9)  |  Patents (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (64 KB)  

    Workflow technology has emerged as an appropriate platform for consolidating the distributed information resources of an enterprise, promoting interoperability across cross-platform systems and for providing a global view and understanding of business process models. However, the business processes that workflows represent, are dynamic by nature, that is, they encounter frequent and unavoidable ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying databases of annotated speech

    Publication Year: 2000 , Page(s): 12 - 20
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (76 KB)  

    Annotated speech corpora are databases consisting of signal data along with time-aligned symbolic `transcriptions'. Such databases are typically multidimensional, heterogeneous and dynamic. These properties present a number of tough challenges for representation and query. The temporal nature of the data adds an additional layer of complexity. This paper presents and harmonises two independent eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared result identification for materialized view selection

    Publication Year: 2000 , Page(s): 49 - 56
    Request Permissions | Click to expandAbstract | PDF file iconPDF (60 KB)  

    Selecting views to materialize impacts on the efficiency as well as the total cost of establishing and running a data warehouse. As such, it is important to select the right views to materialize during the data warehouse design phase. A data warehouse may contain multiple views which can be defined over overlapping portions of data. Identifying the shared views or shared parts of a particular view... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated architecture for exploring, wrapping, mediating and restructuring information from the Web

    Publication Year: 2000 , Page(s): 82 - 89
    Request Permissions | Click to expandAbstract | PDF file iconPDF (120 KB)  

    The goal of information extraction from the Web is to provide an integrated view on heterogeneous information sources. A main problem with current wrapper/mediator approaches is that they rely on very different formalisms and tools for wrappers and mediators, thus leading to an “impedance mismatch” between the wrapper and mediator level. Additionally, most approaches currently are tail... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A query mediation approach to interoperability of heterogeneous databases

    Publication Year: 2000 , Page(s): 41 - 48
    Request Permissions | Click to expandAbstract | PDF file iconPDF (80 KB)  

    The need to transform queries between heterogeneous databases arises in many circumstances, including query transformation between a global and a local query. This paper describes a query mediation approach to the interoperability of heterogeneous databases. We develop a query mediation architecture that facilitates automated query transformation, which is applicable in many circumstances, such as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards an accommodation of delay in temporal active databases

    Publication Year: 2000 , Page(s): 115 - 119
    Request Permissions | Click to expandAbstract | PDF file iconPDF (48 KB)  

    Business rules can be formulated according to the event-condition-action structure of triggers in active databases. However, delays in the execution of such rules can cause unexpected and undesired side-effects. While business rules are commonly constructed from an external user's perspective, users often neglect to cater for the cases in which unanticipated sequences of I/O and rule activation ev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database standards: silver bullet or boat anchor?

    Publication Year: 2000 , Page(s): 2
    Request Permissions | Click to expandAbstract | PDF file iconPDF (8 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A caching protocol to improve CORBA performance

    Publication Year: 2000 , Page(s): 140 - 148
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (84 KB)  

    For many distributed data intensive applications, the default remote invocation of CORBA objects to a server is not acceptable because of performance degradation. Caching can improve performance and scalability of such applications by increasing the locality of data. This paper proposes a caching approach that optimises the default remote invocation behaviour of CORBA clients. Efficient fine-grain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • T-tree or B-tree: main memory database index structure revisited

    Publication Year: 2000 , Page(s): 65 - 73
    Cited by:  Papers (7)  |  Patents (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (92 KB)  

    While the B-tree (or the B+-tree) is the most popular index structure in disk-based relational database systems, the T-tree has been widely accepted as a promising index structure for main memory databases where the entire database (or most of them) resides in the main memory. However, most work on the T-tree reported in the literature did not take concurrency control into consideration... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized modeling framework for schema versioning support

    Publication Year: 2000 , Page(s): 33 - 40
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (104 KB)  

    Advanced object-oriented applications require the management of schema versions, in order to cope with changes in the structure of the stored data. Two types of versioning have been separately considered so far: branching and temporal. The former arose in application domains like CAD/CAM and software engineering, where different solutions have been proposed to support design schema versions (conso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • O-trees: a constraint-based index structure

    Publication Year: 2000 , Page(s): 127 - 134
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (152 KB)  

    Constraint search trees are a generic approach to search trees where all operations are defined in terms of constraints. This abstract viewpoint makes clear the fundamental operations of search trees and immediately points to new possibilities for search trees. In this paper we present height-balanced constraint search trees (HCSTs), a general approach to building height-balanced index structures,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a protection model for supporting multiple access control policies

    Publication Year: 2000 , Page(s): 107 - 114
    Request Permissions | Click to expandAbstract | PDF file iconPDF (196 KB)  

    The Schematic Protection Model (SPM) allows us to specify the protection structure of an object-oriented database and provides an algorithm to reason about the transmission of privileges. In this paper, we extend the SPM model to support multiple access policies, by introducing the concept of groups and the negation of authorisation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of techniques for selecting text collections

    Publication Year: 2000 , Page(s): 28 - 32
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (104 KB)  

    Techniques for evaluating queries against a distributed text document database allow uniform access to its component collections. One such technique is to first choose a subset of collections, via a selection index. The index captures information about each collection such as which terms occur in which documents, term statistics, and collection statistics. A possible implementation of such an inde... View full abstract»

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