International Journal on Applicationsin Information and Communication Engineering Volume 3:Issue 1: January 2017, pp 1 - 5. www.aetsjournal.com ISSN (Online) : 2394 - 6237 ------------------------------------------------------------------------------------------------------------------------------------------------------ 1 Abstract— Web users and content are increasingly being geo-positioned, and increased focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content. We study the efficient, joint processing of multiple top-k spatial keyword in data mining. Such joint processing is attractive during high query loads and also occurs when multiple queries are used to obfuscate a user’s true query. We propose a novel algorithm and index structure for the joint processing of top-k spatial in data mining process. Empirical studies show that the proposed solution is efficient on real datasets. We also offer analytical studies on synthetic datasets to demonstrate the efficiency of the proposed solution. Keywords -- Textual Descriptions, Top-K Spatial, Multiple Queries, Joint Processing, Synthetic Datasets. I. INTRODUCTION n many cases, a set of parties would like to aggregate private key-value lists and find the keys with the highest aggregate values. This problem is ubiquitous having applications in many fields, including network monitoring, security analysis, and distributed databases. Our work is motivated by a simple profiling application. The server computes top-traffic feature reports, such as top client, and we would like to compare local top- reports with aggregate reports corresponding to the data of multiple cooperating collectors. Moreover, organizations maintaining reputation scores for identifiers, like data sent, data received, addresses, can aggregate their scores to find the overall top-scored identifiers. Unfortunately, these Dr.G.Komarasamy , Asst.Prof (Sr.G) , Department of Computer Science and Engineering , Bannari Amman Institute of Technology, Sathyamangalam, India . B. Priyachandru , Department of Computer Science and Engineering , Bannari Amman Institute of Technology, Sathyamangalam, India V. GuruMoorthy , Department of Computer Science and Engineering , Bannari Amman Institute of Technology, Sathyamangalam, India M. Karthick , Department of Computer Science and Engineering , Bannari Amman Institute of Technology, Sathyamangalam, India and other similar distributed problems lack practical solutions that preserve the privacy of the involved data. II. LITERATURE REVIEW A large-scale wireless sensor network constructed in terms of two-tiered architecture, where cloud nodes take charge of storing sensed data and processing queries with respect to the sensing nodes and querists, incurs security breach. This is because the importance of cloud nodes makes them attractive to adversaries and raises concerns about data privacy and query result correctness. To address these problems, we propose an efficient approach, namely EQ (efficient query), which mainly prevents adversaries from gaining the information processed by or stored in cloud nodes, and detects the compromised cloud nodes when they misbehave. EQ can not only achieve the goals of data privacy and integrity preserving but also ensure the secure range query without incurring false positive. For data privacy preserving, EQ presents an order encryption mechanism by adopting stream cipher to encrypt/decrypt all sensed data such that a cloud node can only process issued queries over stored data in the encryption domain. III. SYSTEM STUDY A.Existing System The existing user search does not get perfect queries. The existing queries cannot simultaneously prune the search space using both keyword similarity and spatial distance and this is considering only keyword based queries.. Disadvantage: 1. It cannot simultaneously prune the search space using both keyword similarity and spatial distance. 2. The existing works consider keyword based queries. 3. Client and server communication only available. But cannot find the top n user communication. B.Proposed System We propose a novel algorithm and index Dr.G.Komarasamy , B.Priyachandru , V.GuruMoorthy, M.Karthick DOMINANT TOP K QUERY CONSEQUENCE INTEGRITY VALIDATION USING DATA MINING I