CHAINED INDEXES: A DATA STRUCTURE FOR EFFICIENT PROCESSING OF CONJUNCTIVE QUERIES ON MULTIPLE ATTRIBUTES.

Famelis, G; Kollias, J

dc.contributor.author	Famelis, G	en
dc.contributor.author	Kollias, J	en
dc.date.accessioned	2014-03-01T02:47:36Z
dc.date.available	2014-03-01T02:47:36Z
dc.date.issued	1985	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33280
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0022282109&partnerID=40&md5=25393a2b7907933b28b7aa184dd459d0	en
dc.subject.other	CHAINED INDEXES	en
dc.subject.other	DATA PROCESSING	en
dc.title	CHAINED INDEXES: A DATA STRUCTURE FOR EFFICIENT PROCESSING OF CONJUNCTIVE QUERIES ON MULTIPLE ATTRIBUTES.	en
heal.type	conferenceItem	en
heal.publicationDate	1985	en
heal.abstract	A common characteristic of simple indexing techniques is that each technique might be better than others for some type of usage but concurrently the same technique might be worse than others for some other type of usage. A data structure, called chained indexes, is proposed in an attempt to combine what are considered to be efficient simple indexing techniques for some usage into a new multiattribute index. The structure is defined in terms of a logical description, its physical implementation and a number of processing algorithms. The study suggests promising directions for further study.	en
heal.publisher	North-Holland, Amsterdam, Neth	en
heal.journalName	[No source information available]	en
dc.identifier.spage	273	en
dc.identifier.epage	277	en