Openly accessible

A point-based representation for intervals

Travers, Anthony, Venkatesh, Svetha and Kieronska, Dorota 1995, A point-based representation for intervals, in ANZIIS-95 : Proceedings of the 3rd Australian and New Zealand Conference on Intelligent Information Systems, University of Western Australia, Perth, W. A., pp. 169-174.

Attached Files
Name Description MIMEType Size Downloads
venkatesh-apointbased-1995.pdf Published version application/pdf 509.56KB 25

Title A point-based representation for intervals
Author(s) Travers, Anthony
Venkatesh, Svetha
Kieronska, Dorota
Conference name Australian and New Zealand Conference on Intelligent Information Systems (3rd : 1995 : Perth, W. A.)
Conference location Perth, W. A.
Conference dates 27 Nov. 1995
Title of proceedings ANZIIS-95 : Proceedings of the 3rd Australian and New Zealand Conference on Intelligent Information Systems
Editor(s) [Unknown]
Publication date 1995
Conference series Australian and New Zealand Conference on Intelligent Information Systems
Start page 169
End page 174
Total pages 6
Publisher University of Western Australia
Place of publication Perth, W. A.
Keyword(s) algebra
costs
databases
minimization methods
space technology
Summary Information about time or space is often expressed in terms of points or intervals, and the relations between points and intervals. The interval based representations fall into two distinct classes based on: (i) closure and (ii) minimal representation of the domain. The advantage of closure based representation is the minimal search time at the expense of time to construct the representation, and the storage requirement. Minimal representation optimises storage required, at the expense of construction and search time. Intervals can be represented in terms of their end points. The information about points can be effectively represented using the closure approach but intervals cannot be represented with their endpoints using a point algebra system.

This paper proposes a point based system of representation for interval relations that does not perform closure. Point information is represented in terms of the known relationships between points. The costs of such a representation lies between the expense of closure and minimisation. The time taken for search and construction is better than for minimisation but not as good as for closure. Respectively, the space used is better than for closure but not as good as for minimisation
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 0864224303
Language eng
Field of Research 089999 Information and Computing Sciences not elsewhere classified
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1.1 Full written paper - refereed
Copyright notice ©1995, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30044795

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 24 Abstract Views, 25 File Downloads  -  Detailed Statistics
Created: Tue, 01 May 2012, 10:58:31 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.