Segment indexes

New indexing techniques for interval data in K 2.1 dimensions are proposed consisting of a set of extensions to a class of database indexing structures and illustrated how they may be applied to the R-Tree index and the results of performance experiments are provided.

Abstract

article Free Access Share on Segment indexes: dynamic indexing techniques for multi-dimensional interval data Authors: Curtis P. Kolovson Database Technology Department, Hewlett-Packard Laboratories, 1501 Page Mill Road, Building 3U, Palo Alto, CA Database Technology Department, Hewlett-Packard Laboratories, 1501 Page Mill Road, Building 3U, Palo Alto, CAView Profile , Michael Stonebraker Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CaliforniaView Profile Authors Info & Claims ACM SIGMOD RecordVolume 20Issue 2June 1991 pp 138–147https://doi.org/10.1145/119995.115807Published:01 April 1991Publication History 87citation1,151DownloadsMetricsTotal Citations87Total Downloads1,151Last 12 Months42Last 6 weeks14 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF