In the oracle identification problem we have access to bits of an unknown string x length n, with promise that it belongs a known set $$C\subseteq \{0,1\}^{n}$$ . The goal is identify using as few queries possible. We develop quantum query algorithm for this complexity $$O\left (\sqrt {\frac {n\log M }{\log (n/\log M)+1}}\right )$$ , where size C. This bound already derived by Kothari in 2014, ...

Typically, search engines provide query suggestions to assist users in the process. Query are very important for improving user’s experience. However, most based on logs, and they can be influenced by infrequently searched queries. Depending query, ineffective global but effective a domestic engine. Conversely, it weak engines. In addition, log-based require many which makes them difficu...

Database access logs are the canonical go-to resource for tasks ranging from performance tuning to security auditing. Unfortunately, they are also large, unwieldy, and it can be difficult for a human analyst to divine the intent behind typical queries in the log. With an eye towards creating tools for ad-hoc exploration of queries by intent, we analyze techniques for clustering queries by inten...

Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, O(n log(n)/ε)-query tester for unateness of Boolean functions f : {0, 1}n 7→ {0, 1}. In this note, we describe a simple non-adaptive, O(n log(n/ε)/ε) -query tester for unateness for real-valued functions over the hypercube.

Extensive research has been conducted on query log analysis. A query log is generally represented as a bipartite graph on a query set and a URL set. Most of the traditional methods used the raw click frequency to weigh the link between a query and a URL on the click graph. In order to address the disadvantages of raw click frequency, researchers proposed the entropy-biased model, which incorpor...

Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, O(n log(n)/ε)-query tester for unateness of Boolean functions f : {0, 1} 7→ {0, 1}. In this note, we describe a simple non-adaptive, O(n log(n/ε)/ε) -query tester for unateness for real-valued functions over the hypercube.

Event log processing and analysis play a key role in applications ranging from security management, IT trouble shooting, to user behavior analysis. Recent years have seen a rapid growth in system scales and the corresponding rapid increase in the amount of log event data. At the same time, as logs are found to be a valuable information source, log analysis tasks have become more sophisticated d...

We consider the subset query problem, defined as follows: given a set P of N subsets of a universe U , |U | = m, build a data structure, which for any query set Q ⊂ U detects if there is any P ∈ P such that Q ⊂ P . This is essentially equivalent to the partial match problem and is a fundamental problem in many areas. In this paper we present the first (to our knowledge) algorithms, which achiev...

Event log processing and analysis play a key role in applications ranging from security management, IT trouble shooting, to user behavior analysis. Recent years have seen a rapid growth in system scales and the corresponding rapid increase in the amount of log event data. At the same time, as logs are found to be a valuable information source, log analysis tasks have become more sophisticated d...