Caching dynamic skyline queries

Sacharidis, D; Bouros, P; Sellis, T

dc.contributor.author	Sacharidis, D	en
dc.contributor.author	Bouros, P	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T02:45:10Z
dc.date.available	2014-03-01T02:45:10Z
dc.date.issued	2008	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32179
dc.subject	Caching	en
dc.subject	Dynamic skyline query	en
dc.subject	Skyline	en
dc.subject.other	Administrative data processing	en
dc.subject.other	Indexing (of information)	en
dc.subject.other	Management information systems	en
dc.subject.other	Mechanisms	en
dc.subject.other	Standards	en
dc.subject.other	Statistical methods	en
dc.subject.other	Caching	en
dc.subject.other	Computation costs	en
dc.subject.other	Data sets	en
dc.subject.other	Database management	en
dc.subject.other	Dynamic skyline query	en
dc.subject.other	Experimental evaluations	en
dc.subject.other	International conferences	en
dc.subject.other	Skyline	en
dc.subject.other	Skyline querying	en
dc.subject.other	Database systems	en
dc.title	Caching dynamic skyline queries	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-69497-7_29	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-69497-7_29	en
heal.publicationDate	2008	en
heal.abstract	Given a query tuple q, the dynamic skyline query retrieves the tuples that are not dynamically dominated by any other in the data set with respect to q. A tuple dynamically dominates another, w.r.t. q, if it has closer to q's values in all attributes, and has strictly closer to q's value in at least one. The dynamic skyline query can be treated as a standard skyline query, subject to the transformation of all tuples' values. In this work, we make the observation that results to past dynamic skyline queries can help reduce the computation cost for future queries. To this end, we propose a caching mechanism for dynamic skyline queries and devise a cache-aware algorithm. Our extensive experimental evaluation demonstrates the efficiency of this mechanism compared to standard techniques without caching. © 2008 Springer-Verlag.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-540-69497-7_29	en
dc.identifier.volume	5069 LNCS	en
dc.identifier.spage	455	en
dc.identifier.epage	472	en