Show simple item record

dc.contributor.authorMartínez Parra, Conrado
dc.contributor.authorPahnholzer, A
dc.contributor.authorProdinger, H
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-03-29T10:07:47Z
dc.date.available2016-03-29T10:07:47Z
dc.date.issued1998-10
dc.identifier.citationMartinez, C., Pahnholzer, A., Prodinger, H. "Partial match queries in relaxed multidimensional search trees". 1998.
dc.identifier.urihttp://hdl.handle.net/2117/84777
dc.description.abstractPartial match queries arise frequently in the context of large databases, where each record contains a distinct multidimensional key, that is, the key of each record is a K-tuple of values. The components of a key are called the coordinates or attributes of the key. In a partial match query we specify the value of s attributes, 0 < s < K, and leave the remaining K - s attributes unspecified. The goal is to retrieve all the records in the database that match the specified attributes. In this paper we present several results about the average performance and variance of partial matches in relaxed K-dimensional trees (search trees and digital tries). These data structures are variants of the well known K d-trees and K d-tries. In relaxed trees the sequence of attributes used to guide a query is explicitly stored at the nodes of the tree and randomly generated and, in general, will be different for different search paths. In the standard variants, the sequence of attributes that guides a query examines the attributes in a cyclic fashion, fixed and identical for all search paths. We show that the probabilistic analysis of the relaxed multidimensional trees is very similar to that of standard K d-trees and K d-tries, and also to the analysis of quadtrees. In fact, besides the average cost and variance of partial match in relaxed K d-trees and K d-tries, we also obtain the variance of partial matches in two-dimensional quadtrees. We also compute the average cost of partial matches in other relaxed multidimensional digital tries, namely, relaxed K d-Patricia and relaxed K d-digital search trees
dc.format.extent24 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-98-53-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherPartial match queries
dc.subject.otherMultidimensional search trees
dc.titlePartial match queries in relaxed multidimensional search trees
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1849560
dc.description.versionPostprint (published version)
local.citation.authorMartinez, C.; Pahnholzer, A.; Prodinger, H.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder