Recently, MapReduce based spatial query systems have emerged as a cost effective and scalable solution to large scale spatial data processing and analytics. MapReduce based systems achieve massive scalability by partitioning the data and running query tasks on those partitions in parallel. Therefore, effective data partitioning is critical for task parallelization, load balancing, and directly ...

With the increasing availability and scale of graph data from Web 2.0, graph partitioning becomes one of efficient preprocessing techniques to balance the computing workload. Since the cost of partitioning the entire graph is strictly prohibitive, there are some recent tentative works towards streaming graph partitioning which can run faster, be easily paralleled, and be incrementally updated. ...

Since the hardware-software partitioning problem is a key aspect of the codesign of digital electronic systems, extensive researches have been performed with diverse definitions of partitioning problems. However, existent partitioning solutions are not applicable to many real applications partly because of restricted input specification or insufficient constraints. In this paper, we aim to iden...

It is desirable to design partitioning techniques that minimize the I/O time incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for diierent types of queries. In particular, we show that hexagonal partitioning has optimal I/O cost for circular queries compared to all possible non-overlapping partitioning techniques th...

Data is most important in today’s globe as it helps organizations as well as persons to take out information and use it to make various decisions. Data generally stocked in database so that retrieving and maintaining it becomes easy and manageable. All the operations of data handling and maintenance are done using Database Management System. Data management is much monotonous task in growing da...

The fractal coding algorithm partitions the original image into a number of blocks. Then each block is coded by obtaining the information of the contractive transformations for the block. There are many methods of partitioning an image based on squares and rectangles such as xed-size partitioning, quad-tree partitioning, and HV partitioning. In this paper, we propose an alternating binary-tree ...