Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"preference queries"”.
-
Representative Subsets for Preference Queries
We focus on the two overlapping areas of preference queries and dataset summarization. A (linear) preference query specifies the relative importance of the attributes in a dataset and asks for the tuples that best match those preferences. Dataset summarization is the task of representing an entire …
-
Preference queries processing over imprecise data.
… availability of various data sources, the preference queries are essential to find the relevant results to users. Several preference functions has been introduced in literature including: top-k [1], skylines [2], distributed skyline [3], spatial skyline [4], multi-objective [5], k-dominance …
-
Skyline/Preference query processing
… of relational database systems to support user preferences. In our work, we devise several efficient structures and algorithms for evaluating such preference queries. Specifically, we study the evaluation of three specific types of preference queries. First, skyline queries which allow users to …
-
Μέθοδοι εξόρυξης και επεξεργασίας ερωτημάτων σε ροές δεδομένων
… low memory requirements. We examine similarity queries between different data streams and we propose an indexing scheme suitable for dynamic data. We also propose algorithms for continuous preference queries evaluation problems in sensor networks. We introduce queries for knowledge discovery and …
-
Integrating OLAP and Ranking: The Ranking-Cube Methodology
… On-Line Analytical Processing (OLAP) of ranked queries, where ranked queries are conducted in the arbitrary subset of data defined by multi-dimensional selections. While pre-computation and multi-dimensional aggregation is the standard solution for OLAP, materializing dynamic ranking results is …
-
Terrain Cost Learning from Human Preferences for Robot Path Planning Using a Visual User Interface
… This can be accomplished by leveraging the path preferences of a human operator so that, with selective inputs, the agent can effectively learn a terrain-cost mapping in order to determine the optimal route, thereby eliminating the need for traversal. This thesis aims to achieve this goal by …
-
Efficient computation of advanced skyline queries.
… making, data mining and visualization, and user-preference queries. Due to its importance, skyline and its computation have received considerable attention from database research community recently. All the existing techniques, however, focus on the conventional databases. They are not applicable …
-
Εξατομικευμένα συστήματα διαχείρισης δεδομένων
… regarding the characteristics, interests and preferences of users and the corresponding usage scenarios. In this context, several challenges emerge for both users and information providers, since for the former the task of discovering the portions of information that are the most relevant to …
-
Efficient Algorithms for Querying Large and Uncertain Data
… input data into an index to efficiently answer queries over data. In many real applications we need to handle a large amount of data or/and data that are ambiguous because of human errors and data integration. With the data sets becoming increasingly large and complex, queries are also becoming …
-
Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems
… revisits the well-known problem of answering preference top-k queries, which arise in a wide range of applications in databases and computational geometry. Given a set of n points, each with d real-valued attributes, the goal is to organize the points into a suitable data structure so that …
-
Algorithms for continuous queries: A geometric approach
… supporting potentially millions of continuous queries is a huge challenge. This dissertation addresses the problem of scalably processing a large number of continuous queries over a wide-area network. </p><p>Conceptually, the task of supporting distributed continuous queries can be divided into …
-
Techniques for learning constraint satisfaction problems with applications in telecommunications
… encounter problems, are the large number of queries required, and the high cpu times needed to generate queries, especially near convergence. This problem is even bigger when the problem contains certain classes of constraints, like linear constraints, as there are no methods to handle …