2,823 Hits in 2.7 sec

Locality-preserving hashing in multidimensional spaces

Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala
1997 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97  
We consider localitg-preserving hashing -in which adjacent points in the domain are mapped to adjacent or nearlyadjacent points in the range -when the domain is a ddimensional cube.  ...  We show that simple and natural classes of hash functions are provably good for this problem.  ...  In Section 5 we present severaf negative results exploring the intrinsic limitations of locality-preserving hash functions.  ... 
doi:10.1145/258533.258656 dblp:conf/stoc/IndykMRV97 fatcat:s6fqenzxjzflho46pbkm47hwnu

Robust distributed indexing for locality-skewed workloads

Mu-Woong Lee, Seung-won Hwang
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
The goal of existing efforts in distributed indexing has been the localization of queries to data residing at a small number of nodes (i.e., locality-preserving indexing) to minimize communication cost  ...  Multidimensional indexing is crucial for enabling a fast search over large-scale data.  ...  In contrast, the locality-preserving index and the consistent hashing exhibit unstable utilization. The utilization of the locality-preserving index fluctuates widely.  ... 
doi:10.1145/2396761.2398438 dblp:conf/cikm/LeeH12 fatcat:ekuc5owf5jd2zgq3n6leug7iqi

A Scalable Index Architecture for Supporting Multi-Dimensional Range Queries in Peer-to-Peer Networks

Xiaoyu Yang, Yiming Hu
2006 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing  
Instead, it exploits the embedded trees in the underlying distributed hash tables to refine and deliver queries.  ...  Based on efficient space mapping and query routing mechanisms, Dak can provide a scalable platform to support any number of indexes with different dimensionalities.  ...  Uniform Locality-preserving Hashing A key component of Dak is a locality-preserving hashing (LPH for short) scheme that partitions and maps the multidimensional data space to the 1-d key space.  ... 
doi:10.1109/colcom.2006.361862 dblp:conf/colcom/YangH06 fatcat:ng4d3ovssja3nokdeskww37h6q

Indexing of Query on Spatial Data in P2P Systems

AR. Arunachalam
2012 IOSR Journal of Engineering  
The main objective of this paper is to analyze the process of preserving the locality and dimensionality of space in the network.  ...  It requires the potential of preserving multidimensionality of heterogeneous spatial data without the time complexity and load balancing.  ...  Thus, successors assure that there is always a path between two arbitrary peers in the network. Moreover, successors preserve the locality and the directionality of the 2D space in the P2P network.  ... 
doi:10.9790/3021-0203451453 fatcat:m5ovnigcinei7movrafdzzywam

A survey of P2P multidimensional indexing structures [article]

Ewout Bongers, Johan Pouwelse
2015 arXiv   pre-print
Traditional databases have long since reaped the benefits of multidimensional indexes. Numerous proposals in the literature describe multidimensional index designs for P2P systems.  ...  Several proposals for P2P multidimensional indexes are reviewed and analyzed. Znet and VBI-tree are the most promising from a technical standpoint.  ...  By using locality preserving hashes the Multi-Attribute Addressable Network (MAAN) [4] aims to do just that. With locality preserving hashing, dimensions are directly mapped to a linear space.  ... 
arXiv:1507.05501v1 fatcat:lf5zbvnklnda7ofjrkgyhrs3au

A Correlation-Aware Data Placement Strategy for Key-Value Stores [chapter]

Ricardo Vilaça, Rui Oliveira, José Pereira
2011 Lecture Notes in Computer Science  
We present a novel data placement strategy, supporting dynamic tags, based on multidimensional locality-preserving mappings.  ...  In this paper we exploit arbitrary data relations easily expressed by the application to foster data locality and improve the performance of complex queries common in social network read-intensive workloads  ...  The strategy uses a dimension reducing and locality-preserving indexing scheme that effectively maps the multidimensional information space to the identifier space, [0, 1].  ... 
doi:10.1007/978-3-642-21387-8_17 fatcat:fxxij34iz5ampcnwfmw3zum7vi

Hashing with Non-Linear Manifold Learning

Yanzhen Liu, Xiao Bai, Cheng Yan, Jing Wang, Jun Zhou
2016 2016 International Conference on Digital Image Computing: Techniques and Applications (DICTA)  
This enables better preservation of the sematic similarity in the hash code when mapping the original dataset to low-dimensional space.  ...  Hashing methods achieve quick retrieval by converting the high-dimensional raw data into a binary hash code, keeping the similarity of original data in mapped hash codes.  ...  These methods can be divided into two categories, global preserving manifold learning method and local preserving manifold learning method.  ... 
doi:10.1109/dicta.2016.7797046 dblp:conf/dicta/Liu0YWZ16 fatcat:ksvnur5ca5bd3p7ydhiidyeldy

Privacy-Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment

Wenwen Gong, Lianyong Qi, Yanwei Xu
2018 Wireless Communications and Mobile Computing  
Locality-Sensitive Hashing (LSH) technique has recently been introduced to realize the privacy-preserving distributed service recommendation.  ...  In this situation, service recommendation has become one of the promising ways to alleviate such burdens.  ...  Locality-Sensitive Hashing (LSH).  ... 
doi:10.1155/2018/3075849 fatcat:acps67usojdapdauu3gf7aiegq

A Survey on Big IoT Data Indexing: Potential Solutions, Recent Advancements, and Open Issues

Zineddine Kouahla, Ala-Eddine Benrazek, Mohamed Amine Ferrag, Brahim Farou, Hamid Seridi, Muhammet Kurulay, Adeel Anjum, Alia Asheralieva
2021 Future Internet  
The real-world applications of the existing indexing techniques in different areas, such as health, business, scientific experiments, and social networks, are presented.  ...  However, efficient retrieval and management of such information in terms of index size and search time require optimization of indexing schemes which is rather difficult to implement.  ...  We hope that this survey will be useful for researchers interested in indexing large IoT data.  ... 
doi:10.3390/fi14010019 fatcat:xnlzg7cs2fb3lgng65ha5ucf5m

Isometric Mapping Hashing [chapter]

Yanzhen Liu, Xiao Bai, Haichuan Yang, Zhou Jun, Zhihong Zhang
2015 Lecture Notes in Computer Science  
In this paper, we present a hashing scheme that preserves the geodesic distance and use a feasible out-of-sample method to generate the binary codes efficiently.  ...  However, it is the geodesic distance rather than the Euclidean distance that more accurately characterizes the semantic similarity of data, especially in a high dimensional space.  ...  In other words, we should construct a mapping from high-dimension Euclidean space to Hamming space and preserve the original Euclidean distance of data in the Hamming space.  ... 
doi:10.1007/978-3-319-18224-7_32 fatcat:jbcpund745a67hgf6xl26yx5gq

A Mapping Function for the Directory of a Multidimensional Extendible Hashing

Ekow J. Otoo
1984 Very Large Data Bases Conference  
We define such a function with element address computation in time O(d), and we show how the result applies to the design of a multidimensional extendible hashing.  ...  A generalization of the Extendible Hashing scheme of Fagin and others is presented for structuring files of records with d-attribute fields.  ...  This research is supported in part by grants from the National Research Council of Canada and GR5 grant from Carleton University. I would also like to thank N.  ... 
dblp:conf/vldb/Otoo84 fatcat:qwzi6ouyyjfiln35rtt2nwgeym

Hashing Techniques

Lianhua Chi, Xingquan Zhu
2017 ACM Computing Surveys  
Hashing techniques have also evolved from simple randomization approaches to advanced adaptive methods considering locality, structure, label information, and data security, for effective hashing.  ...  This survey reviews and categorizes existing hashing techniques as a taxonomy, in order to provide a comprehensive view of mainstream hashing techniques for different types of data and applications.  ...  In order to preserve the data characteristics in the original feature space, locality-sensitive hashing was introduced. 4.1.2. Locality-Sensitive Hashing.  ... 
doi:10.1145/3047307 fatcat:u5asusjs7vdq7f3a6wgnesnodq

Privacy and integrity preserving multi-dimensional range queries for cloud computing

Fei Chen, Alex X. Liu
2014 2014 IFIP Networking Conference  
To preserve privacy, we propose an order-preserving hash-based function to encode both data and queries so that a cloud provider can correctly process encoded queries over encoded data without knowing  ...  To preserve integrity, we propose a new data structure called local bit matrices that allows a customer to verify the integrity of a query result with a high probability.  ...  Order-Preserving Hash-based Function In this paper, we propose an order-preserving hash-based function f k .  ... 
doi:10.1109/ifipnetworking.2014.6857083 dblp:conf/networking/ChenL14 fatcat:liqmlboscnbrndflohah3vt33e

A Lightweight Multidimensional Index for Complex Queries over DHTs

Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-Chien Lee, Dingxiong Deng, Yue Wang
2011 IEEE Transactions on Parallel and Distributed Systems  
In this paper, we study the problem of indexing multidimensional data in P2P networks based on distributed hash tables (DHTs).  ...  First, to preserve data locality, m-LIGHT employs a clever naming mechanism that gracefully maps a tree-based index into the DHT and contributes to high efficiency in both index maintenance and query processing  ...  First, the label-to-DHT-key naming mechanism should be redesigned to preserve the spatial proximity in multidimensional space.  ... 
doi:10.1109/tpds.2011.91 fatcat:hbbbkvf525hldbe3g52rlcpnoy

Near-Isometric Binary Hashing for Large-scale Datasets [article]

Amirali Aghazadeh, Andrew Lan, Anshumali Shrivastava, Richard Baraniuk
2016 arXiv   pre-print
In contrast to conventional hashing schemes, which typically rely on an ℓ_2-norm (i.e., average distortion) minimization, NIBH is based on a ℓ_∞-norm (i.e., worst-case distortion) minimization that provides  ...  several benefits, including superior distance, ranking, and near-neighbor preservation performance.  ...  In this paper, we are interested in learning near-isometric binary embeddings, i.e., hash functions that preserve the distances between data points up to a given distortion in the Hamming space.  ... 
arXiv:1603.03836v1 fatcat:s2z6ddlnijfhjgm57u7xexbrhu
« Previous Showing results 1 — 15 out of 2,823 results