Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results
Top-k queries, in particular those based on a linear scoring function, are a common way to
extract relevant results from large datasets. Their major advantage over alternative …
extract relevant results from large datasets. Their major advantage over alternative …
A survey on search results diversification techniques
The quantity of information placed on the web has been greater than before and is
increasing rapidly day by day. Searching through the huge amount of data and finding the …
increasing rapidly day by day. Searching through the huge amount of data and finding the …
Solving diversity-aware maximum inner product search efficiently and effectively
Maximum inner product search (or k-MIPS) is a fundamental operation in recommender
systems that infer preferable items for users. To support large-scale recommender systems …
systems that infer preferable items for users. To support large-scale recommender systems …
Disc diversity: result diversification based on dissimilarity and coverage
Recently, result diversification has attracted a lot of attention as a means to improve the
quality of results retrieved by user queries. In this paper, we propose a new, intuitive …
quality of results retrieved by user queries. In this paper, we propose a new, intuitive …
A collaborative filtering approach for recommending OLAP sessions
While OLAP has a key role in supporting effective exploration of multidimensional cubes, the
huge number of aggregations and selections that can be operated on data may make the …
huge number of aggregations and selections that can be operated on data may make the …
Efficient selection of geospatial data on maps for interactive and visualized exploration
With the proliferation of mobile devices, large collections of geospatial data are becoming
available, such as geo-tagged photos. Map rendering systems play an important role in …
available, such as geo-tagged photos. Map rendering systems play an important role in …
Efficient k-regret query algorithm with restriction-free bound for any dimensionality
Extracting interesting tuples from a large database is an important problem in multi-criteria
decision making. Two representative queries were proposed in the literature: top-k queries …
decision making. Two representative queries were proposed in the literature: top-k queries …
NoSQL Databases
M Carro - arxiv preprint arxiv:1401.2101, 2014 - arxiv.org
In this document, I present the main notions of NoSQL databases and compare four selected
products (Riak, MongoDB, Cassandra, Neo4J) according to their capabilities with respect to …
products (Riak, MongoDB, Cassandra, Neo4J) according to their capabilities with respect to …
Top-k Socio-Spatial Co-Engaged Location Selection for Social Users
With the advent of location-based social networks, users can tag their daily activities in
different locations through check-ins. These check-in locations signify user preferences for …
different locations through check-ins. These check-in locations signify user preferences for …
Diversified top-k subgraph querying in a large graph
Z Yang, AWC Fu, R Liu - … of the 2016 International Conference on …, 2016 - dl.acm.org
Subgraph querying in a large data graph is interesting for different applications. A recent
study shows that top-k diversified results are useful since the number of matching subgraphs …
study shows that top-k diversified results are useful since the number of matching subgraphs …