• No results found

top-k queries

A Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods

A Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods

... linear top-k ...reverse topk query is defined. The two versions of reverse top-k query are used, namely monochromatic and ...reverse top-k query and provide the ...

5

Estimation Of Potential Product Using Reverse Top-K Queries

Estimation Of Potential Product Using Reverse Top-K Queries

... through top-k ...reverse top-k query, that covers the requirement of potential product, which are the user preferences that make this product belong to the top-k query result ...

6

An Efficient Strategy for Monitoring Top k Queries in Document Streaming

An Efficient Strategy for Monitoring Top k Queries in Document Streaming

... one-off) top-k queries over static document ...preview queries has been trailed by most methodologies for ceaseless best k look, though adjusted to the "standing" idea of the ...

6

Unified Framework for Handling Different Types of Top-K Queries

Unified Framework for Handling Different Types of Top-K Queries

... types top-k queries such pairs queries and group ...pairs queries which retrieve the results as in the form of object ...group queries it retrieves the values in the form of ...

11

Detection of Spatio Textual Top K Queries in Location Based Services Using Reverse Keyword Search

Detection of Spatio Textual Top K Queries in Location Based Services Using Reverse Keyword Search

... Abstract— A spatio-textual query retrieves the best objects with respect to a given location and a keyword set. A common solution is to employ a hybrid index which records the digest of the spatial and textual ...

11

Evaluating Continuous Monitoring of Top k Queries Using Sliding Window

Evaluating Continuous Monitoring of Top k Queries Using Sliding Window

... The Top k Monitoring Algorithm comprises of three modules, for example, matrix based record structure, top k algorithm module and support ...

6

Dictionary Compression: An Optimal Answering for Continuous Top k Dominating Queries

Dictionary Compression: An Optimal Answering for Continuous Top k Dominating Queries

... Single socket half duplex network connection is initialized with user interactable menus for Appending, Reading and deleting central server database. Each client users are allocated with a time frame to send ...

6

Efficient Maintenance of Uncertain Databases

Efficient Maintenance of Uncertain Databases

... progressive top k algorithm, which progressively reports each top ranking object one-by-one, until the missing object comes forth to the result set with a ...for top-k queries ...

5

A Unified Framework for answering k Closest Pairs Queries and Variants using Grouping of Objects

A Unified Framework for answering k Closest Pairs Queries and Variants using Grouping of Objects

... answering k closest pairs queries, k furthest pairs queries and their variants by using the concept of grouping of ...of top-k queries including top-k pairs ...

7

Continuous Top-K Monitoring on Document Streams

Continuous Top-K Monitoring on Document Streams

... the top a small number of facets best match the probable user ...continuous top-k queries over text and feedback streams featuring generalized scoring functions which capture dynamic ranking ...

10

Obtaining K-Most Demanding Product Using Exact Top K Algorithm

Obtaining K-Most Demanding Product Using Exact Top K Algorithm

... reverse top-k queries and presented two forms of the query, to be specific monochromatic and ...reverse top-k query in the solution space that serves to comprehend the reverse ...

6

Top-k Dominating Queries on Incomplete Data

Top-k Dominating Queries on Incomplete Data

... The top-k doming (TKD) query returns k objects that exceed the maximum number of objects in a given ...and top k queries, and plays an important role in many decision support ...

5

TOP-K DOMINATING QUERY PROCESSING OVER DISTRIBUTED DATA STREAMS Guidan Chen *, Yongheng Wang

TOP-K DOMINATING QUERY PROCESSING OVER DISTRIBUTED DATA STREAMS Guidan Chen *, Yongheng Wang

... With the rapid development of social networks, Internet of Things, mobile Internet, etc. huge amount of data has been produced, and the era of big data has arrived 1. Big data has the characteristics of huge amount of ...

11

Location And Query Privacy In K Nearest Neighbour Queries

Location And Query Privacy In K Nearest Neighbour Queries

... anonymity k, this technique is vulnerable to bad behavior third ...kNN queries with location confidentiality based on ...kNN queries based on PIR with the Paillier public key cryptosystem ...

9

A Survey on Efficient Algorithms for Mining High Utility Item sets from Transactional Databases

A Survey on Efficient Algorithms for Mining High Utility Item sets from Transactional Databases

... the search space. On the other hand, TKO is the first one-phase algorithm developed for top-k HUI mining, which integrates the novel strategies RUC, RUZ and EPB to greatly improve its performance. Empirical ...

5

Top Down K Best A* Parsing

Top Down K Best A* Parsing

... trees top-down, a slightly different data struc- ture is ...represent top-down deriva- tions as a lazy list of expansions. The top node T G G is an empty list, and whenever we expand an outside ...

5

Private  Top-k  Aggregation  Protocols

Private Top-k Aggregation Protocols

... Organization. The rest of this paper is organized as follows. In Section 2, we discuss the related work with extensive analysis and comparison to our work. In Section 3, we outline the preliminaries required for ...

15

Online Learning to Rank with Top-k Feedback

Online Learning to Rank with Top-k Feedback

... The requirement of having a fixed set of items to rank, in the first part of our work, somewhat limits practical applicability. In fact, in the classic multi-armed bandit problem, while non-contextual bandits have ...

50

Enhanced Cache Gird Partitioning Technique for K-NN Queries

Enhanced Cache Gird Partitioning Technique for K-NN Queries

... A k-nearest neighbour (kNN) query finds the nearest k objects to a query point. The basic idea behind kNN algorithms is to determine a search space based on the partial knowledge of object distribution ...

7

k-Nearest Neighbors Queries in Time-Dependent Road Networks

k-Nearest Neighbors Queries in Time-Dependent Road Networks

... and used C++ to implementing all approaches. We generated synthetic time-dependent road networks with temporal resolution of 96 points in time, e.g., a point at every 15 minutes of a day. Each vertex has an uniformly ...

16

Show all 10000 documents...

Related subjects