Abstract

Over recent years, several studies regarding preference queries over data streams have been developed in database and artificial intelligence research fields. Preference queries are useful in many decision making application areas, such as e-commerce, financial analysis, and content personalization. In this article, we explore new aspects of temporal conditional preference queries (tcp-queries) for the StreamPref query language. Tcp-queries allow the user to express how past instants of a data stream can influence the preference of a user at a present instant. In order to increase the utility of the StreamPref query language, we propose herein new operators that allow dealing with subsequences and filtering of sequences by length. To validate our proposal we present a detailed complexity analysis and an extensive set of experiments with synthetic and real datasets, which corroborate the efficiency of the algorithms and the utility of the new operators.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.