Learn More
A prominent parallel data processing tool MapReduce is gaining significant momentum from both industry and academia as the volume of data to analyze grows rapidly. While MapReduce is used in many areas where massive data analysis is required, there are still debates on its performance, efficiency per node, and simple abstraction. This survey intends to(More)
Recently, wireless mobile computing has been realized in the industry, where mobile clients communicate by using their handheld devices. Meanwhile, data broadcasting is an effective way for data dissemination due to its beneficial characteristics such as bandwidth efficiency, energy-efficiency, and scalability. In this paper, we propose an XML stream(More)
— One of the most substantial ways to protect users' sensitive information is encryption. This paper is about the keyword index search system on encrypted documents. It has been thought that the search with errors over encrypted data is impossible because 1 bit difference over plaintexts may reduce to enormous bits difference over cyphertexts. We propose a(More)
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has been used in applications, such as semantic web, bioinformatics, and social networks. In these applications, large-scale graph datasets are very common. However, existing techniques(More)
This paper investigates how to place data objects on air for wireless broadcast such that mobile clients can access the data in short latency. We first define and analyze the problem of wireless data placement, and also propose a measure, named Query Distance (QD), which represents the coherence degree of data set accessed by a query. We show that the(More)
By effective data clustering, the mobile clients can access the data objects of their interest in short latency. In this paper, we propose a clustering method of wireless data for multipoint queries, where wireless data objects are uniformly broadcasted. We first analyze the data clustering problem and propose a new measure, named the Query Distance, i.e.,(More)