BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
function (34)
join (33)
base (23)
use (19)
effici (18)

Stem hash$ (all stems)

243 papers:

SIGMODSIGMOD-2015-0002SLLF #sorting
Cache-Efficient Aggregation: Hashing Is Sorting (IM, PS, AL, WL, FF), pp. 1123–1136.
VLDBVLDB-2015-JhaHLCH #approach #in memory #memory management
Improving Main Memory Hash Joins on Intel Xeon Phi Processors: An Experimental Approach (SJ, BH, ML, XC, HPH), pp. 642–653.
STOCSTOC-2015-AndoniR #approximate
Optimal Data-Dependent Hashing for Approximate Near Neighbors (AA, IR), pp. 793–801.
ICEISICEIS-v1-2015-CostaFMO #clustering #database #scalability
Sharding by Hash Partitioning — A Database Scalability Pattern to Achieve Evenly Sharded Database Clusters (CHC, JVBMF, PHMM, FCMBO), pp. 313–320.
ICEISICEIS-v2-2015-SmirnovP #architecture #hybrid #network #peer-to-peer #privacy #recommendation
Privacy-preserving Hybrid Peer-to-Peer Recommendation System Architecture — Locality-Sensitive Hashing in Structured Overlay Network (AVS, AP), pp. 532–542.
ECIRECIR-2015-MoranL #graph
Graph Regularised Hashing (SM, VL), pp. 135–146.
ECIRECIR-2015-TsaiKH #approximate #distance #multi #probability
Approximating Weighted Hamming Distance by Probabilistic Selection for Multiple Hash Tables (CYT, YHK, WHH), pp. 123–134.
ICMLICML-2015-ChenWTWC #network
Compressing Neural Networks with the Hashing Trick (WC, JTW, ST, KQW, YC), pp. 2285–2294.
ICMLICML-2015-LengWCZL #distributed
Hashing for Distributed Data (CL, JW, JC, XZ, HL), pp. 1642–1650.
KDDKDD-2015-GaoJOW
Selective Hashing: Closing the Gap between Radius Search and k-NN Search (JG, HVJ, BCO, SW), pp. 349–358.
KDDKDD-2015-OuCWW0 #component #similarity #transitive
Non-transitive Hashing with Latent Similarity Components (MO, PC, FW, JW, WZ), pp. 895–904.
SIGIRSIGIR-2015-MoranL
Regularised Cross-Modal Hashing (SM, VL), pp. 907–910.
SIGIRSIGIR-2015-PanYLNM #scalability #semantics #visual notation
Semi-supervised Hashing with Semantic Confidence for Large Scale Visual Search (YP, TY, HL, CWN, TM), pp. 53–62.
SIGIRSIGIR-2015-WangLWZZ #learning #named
LBMCH: Learning Bridging Mapping for Cross-modal Hashing (YW, XL, LW, WZ, QZ), pp. 999–1002.
OOPSLAOOPSLA-2015-SteindorferV #agile #optimisation #performance #virtual machine
Optimizing hash-array mapped tries for fast and lean immutable JVM collections (MJS, JJV), pp. 783–800.
PODSPODS-2014-PaghSW #question #set
Is min-wise hashing optimal for summarizing set intersection? (RP, MS, DPW), pp. 109–120.
SIGMODSIGMOD-2014-GaoJLO #named
DSH: data sensitive hashing for high-dimensional k-nnsearch (JG, HVJ, WL, BCO), pp. 1127–1138.
VLDBVLDB-2015-BarberLPRSACLS14
Memory-Efficient Hash Joins (RB, GML, IP, VR, RS, GKA, NC, SL, DS), pp. 353–364.
ITiCSEITiCSE-2014-MaTKMSW #algorithm #named #visualisation
SHAvisual: a secure hash algorithm visualization tool (JM, JT, MSK, JM, CKS, CW), p. 338.
SCAMSCAM-2014-LiangSM #analysis #performance
Fast Flow Analysis with Godel Hashes (SL, WS, MM), pp. 225–234.
CIKMCIKM-2014-LengCWZL #constraints
Supervised Hashing with Soft Constraints (CL, JC, JW, XZ, HL), pp. 1851–1854.
CIKMCIKM-2014-WangSZS #performance #scalability #semantics #similarity
Sparse Semantic Hashing for Efficient Large Scale Similarity Search (QW, BS, ZZ, LS), pp. 1899–1902.
ICMLICML-c1-2014-ErmonGSS #constraints #integration
Low-density Parity Constraints for Hashing-Based Discrete Integration (SE, CPG, AS, BS), pp. 271–279.
ICMLICML-c1-2014-Shrivastava0 #performance #permutation
Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search (AS, PL), pp. 557–565.
ICPRICPR-2014-DuZCW #flexibility #learning #linear #random
Learning Flexible Binary Code for Linear Projection Based Hashing with Random Forest (SD, WZ, SC, YW), pp. 2685–2690.
ICPRICPR-2014-GaurHC #design #distance #image #kernel #multi
Design of Multi-kernel Distance Based Hashing with Multiple Objectives for Image Indexing (VG, EH, SC), pp. 2637–2642.
ICPRICPR-2014-SenletEE #locality #semantics #visual notation
Hierarchical Semantic Hashing: Visual Localization from Buildings on Maps (TS, TEG, AME), pp. 2990–2995.
ICPRICPR-2014-WangWCY #geometry
Fingerprint Geometric Hashing Based on Binary Minutiae Cylinder Codes (YW, LW, YmC, PCY), pp. 690–695.
KDDKDD-2014-SchubertWK #detection #named #scalability #topic
SigniTrend: scalable detection of emerging topics in textual streams by hashed significance thresholds (ES, MW, HPK), pp. 871–880.
KDDKDD-2014-WeiSZL0 #scalability
Scalable heterogeneous translated hashing (YW, YS, YZ, BL, QY), pp. 791–800.
SIGIRSIGIR-2014-WangSZZ
Active hashing with joint data example and tag selection (QW, LS, ZZ, NZ), pp. 405–414.
SIGIRSIGIR-2014-YuWYTLZ #performance #retrieval #taxonomy
Discriminative coupled dictionary hashing for fast cross-media retrieval (ZY, FW, YY, QT, JL, YZ), pp. 395–404.
SIGIRSIGIR-2014-YuWZTSZ #learning #rank
Hashing with List-Wise learning to rank (ZY, FW, YZ, ST, JS, YZ), pp. 999–1002.
SIGIRSIGIR-2014-ZhangWRS #performance #recommendation
Preference preserving hashing for efficient recommendation (ZZ, QW, LR, LS), pp. 183–192.
SIGIRSIGIR-2014-ZhangZLG #modelling
Supervised hashing with latent factor models (PZ, WZ, WJL, MG), pp. 173–182.
SIGIRSIGIR-2014-ZhouDG #semantics #similarity
Latent semantic sparse hashing for cross-modal similarity search (JZ, GD, YG), pp. 415–424.
GPCEGPCE-2014-SteindorferV #memory management #performance
Code specialization for memory efficient hash tries (short paper) (MJS, JJV), pp. 11–14.
ICDARICDAR-2013-DuAD #multi #scalability #using
Large-Scale Signature Matching Using Multi-stage Hashing (XD, WAA, DSD), pp. 976–980.
ICDARICDAR-2013-MondalRRP #kernel #locality #performance #retrieval #word
A Fast Word Retrieval Technique Based on Kernelized Locality Sensitive Hashing (TM, NR, JYR, UP), pp. 1195–1199.
PODSPODS-2013-Indyk #fourier #sketching
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform (PI), pp. 87–90.
SIGMODSIGMOD-2013-SongYYHS #data flow #retrieval #scalability #semistructured data
Inter-media hashing for large-scale retrieval from heterogeneous data sources (JS, YY, YY, ZH, HTS), pp. 785–796.
VLDBVLDB-2013-HeLH #architecture #cpu #gpu
Revisiting Co-Processing for Hash Joins on the Coupled CPU-GPU Architecture (JH, ML, BH), pp. 889–900.
VLDBVLDB-2013-LeeL #clustering #graph #query #rdf #scalability #semantics
Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning (KL, LL), pp. 1894–1905.
VLDBVLDB-2013-SundaramTSMIMD #parallel #similarity #streaming #twitter #using
Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing (NS, AT, NS, TM, PI, SM, PD), pp. 1930–1941.
VLDBVLDB-2014-BalkesenATO13 #in memory #manycore #revisited
Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited (CB, GA, JT, MTÖ), pp. 85–96.
CIKMCIKM-2013-HachenbergG #classification #clustering #documentation #locality #scalability #web
Locality sensitive hashing for scalable structural classification and clustering of web documents (CH, TG), pp. 359–368.
CIKMCIKM-2013-WangZS #performance #scalability #similarity
Weighted hashing for fast large scale similarity search (QW, DZ, LS), pp. 1185–1188.
ICMLICML-c1-2013-LiLSHD #generative #learning #using
Learning Hash Functions Using Column Generation (XL, GL, CS, AvdH, ARD), pp. 142–150.
ICMLICML-c2-2013-ErmonGSS #integration #optimisation
Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization (SE, CPG, AS, BS), pp. 334–342.
ICMLICML-c3-2013-RastegariCFHD #predict
Predictable Dual-View Hashing (MR, JC, SF, HDI, LSD), pp. 1328–1336.
KDDKDD-2013-OuCWWZY #scalability
Comparing apples to oranges: a scalable solution with heterogeneous hashing (MO, PC, FW, JW, WZ, SY), pp. 230–238.
SIGIRSIGIR-2013-WangZS #modelling #semantics #topic #using
Semantic hashing using tags and topic modeling (QW, DZ, LS), pp. 213–222.
SIGMODSIGMOD-2012-GanFFN
Locality-sensitive hashing scheme based on dynamic collision counting (JG, JF, QF, WN), pp. 541–552.
SIGMODSIGMOD-2012-OhKKL #sorting
Reducing cache misses in hash join probing phase by pre-sorting strategy (abstract only) (GHO, JMK, WHK, SWL), p. 864.
VLDBVLDB-2012-BenderFJKKMMSSZ #how
Don’t Thrash: How to Cache Your Hash on Flash (MAB, MFC, RJ, RK, BCK, DM, PM, PS, RPS, EZ), pp. 1627–1637.
VLDBVLDB-2012-SatuluriP #locality #performance #similarity
Bayesian Locality Sensitive Hashing for Fast Similarity Search (VS, SP), pp. 430–441.
CIKMCIKM-2012-BahmaniGS #distributed #locality #performance
Efficient distributed locality sensitive hashing (BB, AG, RS), pp. 2174–2178.
CIKMCIKM-2012-BambaSGBF #concept #recommendation #scalability #using
The twitaholic next door.: scalable friend recommender system using a concept-sensitive hash function (PB, JS, CG, NB, JF), pp. 2275–2278.
ICMLICML-2012-LiuWMKC
Compact Hyperplane Hashing with Bilinear Functions (WL, JW, YM, SK, SFC), p. 64.
ICPRICPR-2012-HidoK #graph #learning #similarity
Hash-based structural similarity for semi-supervised Learning on attribute graphs (SH, HK), pp. 3009–3012.
KDDKDD-2012-ZhenY #learning #multimodal #probability
A probabilistic model for multimodal hash function learning (YZ, DYY), pp. 940–948.
SEKESEKE-2012-NarataM #linear
Managing Linear Hash in a Closed Space (SN, TM), pp. 741–746.
SIGIRSIGIR-2012-KongLG #image #retrieval #scalability
Manhattan hashing for large-scale image retrieval (WK, WJL, MG), pp. 45–54.
SIGIRSIGIR-2012-XiaWHJ #image #kernel #multi #retrieval #scalability
Boosting multi-kernel locality-sensitive hashing for scalable image retrieval (HX, PW, SCHH, RJ), pp. 55–64.
SIGIRSIGIR-2012-ZhangWDH #detection #learning #performance #reuse
Learning hash codes for efficient content reuse detection (QZ, YW, ZD, XH), pp. 405–414.
PPoPPPPoPP-2012-MetreveliZK #named
CPHASH: a cache-partitioned hash table (ZM, NZ, MFK), pp. 319–320.
PPoPPPPoPP-2012-ZhangL #linear #named
LHlf: lock-free linear hashing (poster paper) (DZ, PÅL), pp. 307–308.
ICLPICLP-J-2012-ZhouH #performance
Efficient tabling of structured data with enhanced hash-consing (NFZ, CTH), pp. 547–563.
ICSTSAT-2012-Ben-HaimIMM #constraints #encoding
Perfect Hashing and CNF Encodings of Cardinality Constraints (YBH, AI, OM, AM), pp. 397–409.
ICDARICDAR-2011-DuttaLP #graph
Symbol Spotting in Line Drawings through Graph Paths Hashing (AD, JL, UP), pp. 982–986.
ICDARICDAR-2011-HassanCG #distance #documentation #edit distance #image #using
Document Image Indexing Using Edit Distance Based Hashing (EH, SC, MG), pp. 1200–1204.
ICDARICDAR-2011-PanZSN #invariant #using
Recognizing Characters with Severe Perspective Distortion Using Hash Tables and Perspective Invariants (PP, YZ, JS, SN), pp. 548–552.
SIGMODSIGMOD-2011-BlanasLP #algorithm #design #evaluation #in memory #manycore #memory management
Design and evaluation of main memory hash join algorithms for multi-core CPUs (SB, YL, JMP), pp. 37–48.
VLDBVLDB-2011-LeeNS #estimation #locality #similarity #using
Similarity Join Size Estimation using Locality Sensitive Hashing (HL, RTN, KS), pp. 338–349.
STOCSTOC-2011-PatrascuT #power of
The power of simple tabulation hashing (MP, MT), pp. 1–10.
ICMLICML-2011-LiuWKC #graph
Hashing with Graphs (WL, JW, SK, SFC), pp. 1–8.
ICMLICML-2011-NorouziF
Minimal Loss Hashing for Compact Binary Codes (MN, DJF), pp. 353–360.
KDDKDD-2011-DasguptaKS #performance
Fast locality-sensitive hashing (AD, RK, TS), pp. 1073–1081.
KDIRKDIR-2011-VanetikG #mining #named
HashMax: A New Method for Mining Maximal Frequent Itemsets (NV, EG), pp. 140–145.
SIGIRSIGIR-2011-TureEL #similarity
No free lunch: brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity (FT, TE, JJL), pp. 943–952.
SIGIRSIGIR-2011-ZhangWS #multi
Composite hashing with multiple information sources (DZ, FW, LS), pp. 225–234.
PODSPODS-2010-PaghWYZ
Cache-oblivious hashing (RP, ZW, KY, QZ), pp. 297–304.
SIGMODSIGMOD-2010-ShindeGGD #locality #similarity #using
Similarity search and locality sensitive hashing using ternary content addressable memories (RS, AG, PG, DD), pp. 375–386.
ICALPICALP-v1-2010-DietzfelbingerGMMPR #satisfiability
Tight Thresholds for Cuckoo Hashing via XORSAT (MD, AG, MM, AM, RP, MR), pp. 213–225.
ECIRECIR-2010-ZhangWCL #documentation
Laplacian Co-hashing of Terms and Documents (DZ, JW, DC, JL), pp. 577–580.
ICMLICML-2010-WangKC #learning
Sequential Projection Learning for Hashing with Compact Codes (JW, SK, SFC), pp. 1127–1134.
ICPRICPR-2010-BalujaC #learning #performance #retrieval
Beyond “Near Duplicates”: Learning Hash Codes for Efficient Similar-Image Retrieval (SB, MC), pp. 543–547.
ICPRICPR-2010-HarmanciH #adaptation #image #query
Content Adaptive Hash Lookups for Near-Duplicate Image Search by Full or Partial Image Queries (OH, IH), pp. 1582–1585.
ICPRICPR-2010-KumarTG #symmetry
Combination of Symmetric Hash Functions for Secure Fingerprint Matching (GK, ST, VG), pp. 890–893.
ICPRICPR-2010-RathgebU10a #database #generative
Iris-Biometric Hash Generation for Biometric Database Indexing (CR, AU), pp. 2848–2851.
ICPRICPR-2010-ShibataKI #classification #nearest neighbour #performance #scalability
Large Margin Discriminant Hashing for Fast k-Nearest Neighbor Classification (TS, SK, SI), pp. 1015–1018.
ICPRICPR-2010-TakH #image #retrieval
Tertiary Hash Tree: Indexing Structure for Content-Based Image Retrieval (YT, EH), pp. 3167–3170.
KDDKDD-2010-HeLC #kernel #scalability #similarity
Scalable similarity search with optimized kernel hashing (JH, WL, SFC), pp. 1129–1138.
SIGIRSIGIR-2010-ZhangWCL #performance #self #similarity
Self-taught hashing for fast similarity search (DZ, JW, DC, JL), pp. 18–25.
GPCEGPCE-2010-GrechRF #generative #named #similarity
JEqualityGen: generating equality and hashing methods (NG, JR, BF), pp. 177–186.
DATEDATE-2009-HenzenCFF #evaluation #hardware
Hardware evaluation of the stream cipher-based hash functions RadioGatún and irRUPT (LH, FC, NF, WF), pp. 646–651.
VLDBVLDB-2009-KimSCKNBLSD #implementation #manycore #performance
Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs (CK, ES, JC, TK, ADN, ADB, VWL, NS, PD), pp. 1378–1389.
ICALPICALP-v1-2009-ArbitmanNS #performance #worst-case
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results (YA, MN, GS), pp. 107–118.
ICMLICML-2009-WeinbergerDLSA #learning #multi #scalability
Feature hashing for large scale multitask learning (KQW, AD, JL, AJS, JA), pp. 1113–1120.
SACSAC-2009-HendersonCL #performance
Exploiting join cardinality for faster hash joins (MH, BC, RL), pp. 1549–1554.
SACSAC-2009-NeedelsK #distributed #peer-to-peer
Secure routing in peer-to-peer distributed hash tables (KN, MK), pp. 54–58.
ICSEICSE-2009-RaysideBSNMJ #abstraction #generative #implementation #similarity
Equality and hashing for (almost) free: Generating implementations from abstraction functions (DR, ZB, RS, JPN, AM, DJ), pp. 342–352.
DATEDATE-2008-ChavesKSV
Merged Computation for Whirlpool Hashing (RC, GK, LS, SV), pp. 272–275.
PODSPODS-2008-GollapudiP #power of #similarity
The power of two min-hashes for similarity search among hierarchical data objects (SG, RP), pp. 211–220.
VLDBVLDB-2008-HadjieleftheriouYKS #query #set #similarity
Hashed samples: selectivity estimators for set similarity selection queries (MH, XY, NK, DS), pp. 201–212.
VLDBVLDB-2008-WangLLG #documentation #query #xml
Hash-base subgraph query processing method for graph-structured XML documents (HW, JL, JL, HG), pp. 478–489.
ICALPICALP-C-2008-FischlinLP #multi #revisited #robust
Robust Multi-property Combiners for Hash Functions Revisited (MF, AL, KP), pp. 655–666.
ICALPICALP-C-2008-HochS #on the
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (JJH, AS), pp. 616–630.
ICALPICALP-C-2008-NaorSW #independence
History-Independent Cuckoo Hashing (MN, GS, UW), pp. 631–642.
KDDKDD-2008-EshghiR #locality #order #rank #statistics
Locality sensitive hash functions based on concomitant rank order statistics (KE, SR), pp. 221–229.
SACSAC-2008-LangD #evaluation
Digital audio watermarking evaluation within the application field of perceptual hashing (AL, JD), pp. 1192–1196.
DATEDATE-2007-AlhoHHH #design #hardware
Compact hardware design of Whirlpool hashing core (TA, PH, MH, TDH), pp. 1247–1252.
ICALPICALP-2007-AlonG #product line
Balanced Families of Perfect Hash Functions and Their Applications (NA, SG), pp. 435–446.
ICALPICALP-2007-BellareR #design
Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms (MB, TR), pp. 399–410.
CIKMCIKM-2007-BotelhoZ #scalability #set
External perfect hashing for very large key sets (FCB, NZ), pp. 653–662.
SEKESEKE-2007-YasudaM #concurrent
Tree Hash Under Concurrency Control (KY, TM), pp. 574–579.
SIGIRSIGIR-2007-Stein #retrieval
Principles of hash-based text retrieval (BS), pp. 527–534.
ICSTSAT-2007-DeKV #using
Inversion Attacks on Secure Hash Functions Using satSolvers (DD, AK, RV), pp. 377–382.
ICPRICPR-v4-2006-KiseNIY #approach #performance #physics #recognition #towards
Efficient Recognition of Planar Objects Based on Hashing of Keypoints — An Approach Towards Making the Physical World Clickable (KK, TN, MI, SY), pp. 813–816.
ICSTSAT-2006-MironovZ #satisfiability
Applications of SAT Solvers to Cryptanalysis of Hash Functions (IM, LZ), pp. 102–115.
ICDARICDAR-2005-ChellapillaSN #documentation #performance #recognition
Fast Optical Character Recognition through Glyph Hashing for Document Conversion (KC, PYS, RN), pp. 829–834.
ICDARICDAR-2005-LamH #data type #performance #using
A Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access (YKL, QH), pp. 506–510.
VLDBVLDB-2005-Lawrence #algorithm #configuration management #performance
Early Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results (RL), pp. 841–852.
DACDAC-2004-YangKM #architecture #named #optimisation
Divide-and-concatenate: an architecture level optimization technique for universal hash functions (BY, RK, DAM), pp. 614–617.
DATEDATE-DF-2004-DaddaMO #design
The Design of a High Speed ASIC Unit for the Hash Function SHA-256 (384, 512) (LD, MM, JO), pp. 70–75.
ICPRICPR-v3-2004-LifshitsBGRR #geometry
Rehashing for Bayesian Geometric Hashing (ML, IB, RG, ER, MR), pp. 99–102.
HPDCHPDC-2004-DubnickiUK #distributed #named
FPN: A Distributed Hash Table for Commercial Applications (CD, CU, WK), pp. 120–128.
HPDCHPDC-2004-ZhangKPCNWS #algorithm #parallel #using
Strategies for Using Additional Resources in Parallel Hash-Based Join Algorithms (XZ, TMK, TP, ÜVÇ, SN, PW, JHS), pp. 4–13.
DATEDATE-2003-LomenaLWK #approach #explosion #performance #scheduling
An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling (AGL, MLLV, YW, AK), pp. 10428–10435.
STOCSTOC-2003-DietzfelbingerW #graph #random
Almost random graphs with simple hash functions (MD, PW), pp. 629–638.
STOCSTOC-2003-OstlinP #constant #linear
Uniform hashing in constant time and linear space (, RP), pp. 622–628.
ICFPICFP-2003-LeiferPSW
Global abstraction-safe marshalling with hash types (JJL, GP, PS, KW), pp. 87–98.
HPCAHPCA-2003-GassendSCDD #memory management #performance #verification
Caches and Hash Trees for Efficient Memory Integrity Verification (BG, GES, DEC, MvD, SD), pp. 295–306.
SIGMODSIGMOD-2002-LuoEHN #algorithm #scalability
A scalable hash ripple join algorithm (GL, CJE, PJH, JFN), pp. 252–262.
ITiCSEITiCSE-2002-Hamer #revisited
Hashing revisited (JH), pp. 80–83.
STOCSTOC-2002-Micciancio #encryption #worst-case
Improved cryptographic hash functions with worst-case/average-case connection (DM), pp. 609–618.
CIKMCIKM-2002-WuY #adaptation #monitoring #multi #performance #query #using
Efficient query monitoring using adaptive multiple key hashing (KLW, PSY), pp. 477–484.
ICPRICPR-v1-2002-VielhauerSM #online #statistics
Biometric Hash based on Statistical Features of Online Signatures (CV, RS, AM), pp. 123–126.
VLDBVLDB-2001-OzsuLON #database #image #multi #query #similarity
An Extendible Hash for Multi-Precision Similarity Querying of Image Databases (SL, MTÖ, VO, RTN), pp. 221–230.
STOCSTOC-2001-Pagh #complexity #on the
On the cell probe complexity of membership and perfect hashing (RP), pp. 425–432.
CIKMCIKM-2000-MiuraMSW
Extensible Perfect Hashing (TM, WM, IS, YW), pp. 446–452.
VLDBVLDB-1999-GionisIM #similarity
Similarity Search in High Dimensions via Hashing (AG, PI, RM), pp. 518–529.
VLDBVLDB-1999-Graefe #sql
The Value of Merge-Join and Hash-Join in SQL Server (GG), pp. 250–253.
VLDBVLDB-1999-KemperKW
Generalised Hash Teams for Join and Group-by (AK, DK, CW), pp. 30–41.
ICEISICEIS-1999-FanCY
Blind Signatures with Double-Hashes Messages for Fair Electronic Elections and Ownership Claimable Digital Cash (CIF, WKC, YSY), pp. 612–618.
CIKMCIKM-1999-WuY #replication #web
Local Replication for Proxy Web Caches with Hash Routing (KLW, PSY), pp. 69–76.
VLDBVLDB-1998-GraefeBC #sql
Hash Joins and Hash Teams in Microsoft SQL Server (GG, RB, SC), pp. 86–97.
STOCSTOC-1998-CanettiMR #probability
Perfectly One-Way Probabilistic Hash Functions (Preliminary Version) (RC, DM, OR), pp. 131–140.
ICPRICPR-1998-HoffmanL #algorithm #geometry #trade-off
Some trade-offs and a new algorithm for geometric hashing (MH, ML), pp. 1700–1704.
STOCSTOC-1997-AlonDMPT #linear #question
Is Linear Hashing Good? (NA, MD, PBM, EP, GT), pp. 465–474.
STOCSTOC-1997-IndykMRV #multi
Locality-Preserving Hashing in Multidimensional Spaces (PI, RM, PR, SV), pp. 618–625.
STOCSTOC-1997-KargerLLPLL #consistency #distributed #protocol #random #web
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (DRK, EL, FTL, RP, MSL, DL), pp. 654–663.
SACSAC-1997-GoliP #data mining #mining #multi
Application of domain vector perfect hash join for multimedia data mining (VNRG, WP), pp. 334–339.
SIGMODSIGMOD-1996-LoR
Spatial Hash-Joins (MLL, CVR), pp. 247–258.
STOCSTOC-1996-LinialS
Non-Expansive Hashing (NL, OS), pp. 509–518.
ICPRICPR-1996-ChenHW #feature model #geometry #image #modelling #recognition #using
Model-based object recognition using range images by combining morphological feature extraction and geometric hashing (CSC, YPH, JLW), pp. 565–569.
ICPRICPR-1996-YangT #geometry #locality #mobile #modelling
Mobile robot localization by geometric hashing and model-based scene matching (YBY, HTT), pp. 181–185.
SEKESEKE-1996-RigoutsosD #scalability
The Impact of Hashing Function Choice on the Load Balancing in Very Large Dartasets (IR, AD), pp. 301–308.
SACSAC-1996-BhatiaS #database #image
Near perfect hash table for image databases (SKB, CLS), pp. 442–446.
SIGMODSIGMOD-1995-ParkCY #algorithm #effectiveness #mining
An Effective Hash Based Algorithm for Mining Association Rules (JSP, MSC, PSY), pp. 175–186.
CIKMCIKM-1995-Teuhola #clustering #effectiveness #linear
Effective Clustering of Objects Stored by Linear Hashing (JT), pp. 274–280.
SACSAC-1995-PerrizoG #query
Domain vector hashing for earth system data querying (WP, VNRG), pp. 71–75.
DACDAC-1994-HenftlingWA #fault #simulation
Path Hashing to Accelerate Delay Fault Simulation (MH, HCW, KA), pp. 522–526.
SIGMODSIGMOD-1994-HsiaoCY #execution #on the #parallel #pipes and filters
On Parallel Execution of Multiple Pipelined Hash Joins (HIH, MSC, PSY), pp. 185–196.
VLDBVLDB-1994-DavisonG
Memory-Contention Responsive Hash Joins (DLD, GG), pp. 379–390.
STOCSTOC-1994-GoldreichW #product line #random #trade-off
Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing (OG, AW), pp. 574–584.
ICALPICALP-1994-GilM #parallel #performance
Simple Fast Parallel Hashing (JYG, YM), pp. 239–250.
CIKMCIKM-1994-ArefS #database #process #proximity
Hashing by Proximity to Process Duplicates in Spatial Databases (WGA, HS), pp. 347–354.
CIKMCIKM-1994-MarekR
TID Hash Joins (RM, ER), pp. 42–49.
SACSAC-1994-SabharwalB #database #image
A perfect hash function for image database indexing (CLS, SKB), pp. 534–538.
CAVCAV-1994-CousinH #performance
Performance Improvement of State Space Exploration by Regular & Diffrential Hashing Functions (BC, JMH), pp. 364–376.
SIGMODSIGMOD-1993-LitwinNS #distributed #linear
LH* — Linear Hashing for Distributed Files (WL, MAN, DAS), pp. 327–336.
SIGMODSIGMOD-1993-LoCRY #on the #pipes and filters
On Optimal Processor Allocation to Support Pipelined Hash Joins (MLL, MSC, CVR, PSY), pp. 69–78.
SIGMODSIGMOD-1993-PangCL
Partially Preemptive Hash Joins (HP, MJC, ML), pp. 59–68.
VLDBVLDB-1993-VhanHY #execution
Applying Hash Filters to Improving the Execution of Bushy Trees (MSC, HIH, PSY), pp. 505–516.
CAVCAV-1993-WolperL #detection #reliability
Reliable Hashing without Collosion Detection (PW, DL), pp. 59–70.
VLDBVLDB-1992-ChenLYY #execution #pipes and filters #using
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins (MSC, MLL, PSY, HCY), pp. 15–26.
ICALPICALP-1992-DietzfelbingerGMP #polynomial #reliability
Polynomial Hash Functions Are Reliable (Extended Abstract) (MD, JYG, YM, NP), pp. 235–246.
SIGIRSIGIR-1992-FoxCH #algorithm #performance
A Faster Algorithm for Constructing Minimal Perfect Hash Functions (EAF, QFC, LSH), pp. 266–273.
STOCSTOC-1991-MatiasV #parallel #probability
Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) (YM, UV), pp. 307–316.
POPLPOPL-1991-CaiP #array #quote
“Look Ma, No Hashing, And No Arrays Neither” (JC, RP), pp. 143–154.
SIGMODSIGMOD-1990-OlkenRX #random
Random Sampling from Hash Files (FO, DR, PX), pp. 375–386.
VLDBVLDB-1990-CheineyM #clustering #parallel #transitive
A Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering (JPC, CdM), pp. 347–358.
VLDBVLDB-1990-KitsuregawaO #database #parallel #robust
Bucket Spreading Parallel Hash: A New, Robust, Parallel Hash Join Method for Data Skew in the Super Database Computer (SDC) (MK, YO), pp. 210–221.
VLDBVLDB-1990-LuTS #algorithm #multi
Hash-Based Join Algorithms for Multiprocessor Computers (HL, KLT, MCS), pp. 198–209.
VLDBVLDB-1990-SchneiderD #database #multi #query #trade-off
Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines (DAS, DJD), pp. 469–480.
VLDBVLDB-1990-SeverancePW #database #distributed #in memory #linear #memory management #parallel
Distributed Linear Hashing and Parallel Projection in Main Memory Databases (CS, SP, PW), pp. 674–682.
VLDBVLDB-1990-ZellerG #adaptation #algorithm #multi
An Adaptive Hash Join Algorithm for Multiuser Environments (HZ, JG), pp. 186–197.
STOCSTOC-1990-GilHW #constant
Not All Keys Can Be Hashed in Constant Time (Preliminary Version) (JYG, FMadH, AW), pp. 244–253.
STOCSTOC-1990-MansourNT #complexity
The Computational Complexity of Universal Hashing (YM, NN, PT), pp. 235–243.
STOCSTOC-1990-SchmidtS #analysis
The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) (JPS, AS), pp. 224–234.
ICALPICALP-1990-DietzfelbingerH #realtime
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time (MD, FMadH), pp. 6–19.
ICALPICALP-1990-MatiasV #integer #on the #parallel #sorting #summary
On Parallel Hashing and Integer Sorting (Extended Summary) (YM, UV), pp. 729–743.
SIGIRSIGIR-1990-FoxCDH #information retrieval #order
Order Preserving Minimal Perfect Hash Functions and Information Retrieval (EAF, QFC, AMD, LSH), pp. 279–311.
PODSPODS-1989-Rotem #clustering #multi
Clustered Multiattribute Hash Files (DR), pp. 225–234.
VLDBVLDB-1989-KitsuregawaNT #hybrid
The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method (MK, MN, MT), pp. 257–266.
STOCSTOC-1989-NaorY #encryption
Universal One-Way Hash Functions and their Cryptographic Applications (MN, MY), pp. 33–43.
STOCSTOC-1989-SchmidtS #aspect-oriented #on the #performance
On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) (JPS, AS), pp. 355–366.
SIGMODSIGMOD-1988-Ramakrishna #analysis
Hashing in Practive, Analysis of Hashing and Universal Hashing (MVR), pp. 191–199.
VLDBVLDB-1988-NakayamaK #using
Hash-Partitioned Join Method Using Dynamic Destaging Strategy (MN, MK, MT), pp. 468–478.
STOCSTOC-1988-FiatNSS
Non-Oblivious Hashing (Extended Abstract) (AF, MN, JPS, AS), pp. 367–376.
STOCSTOC-1988-LuekerM #analysis
More Analysis of Double Hashing (GSL, MM), pp. 354–359.
SIGIRSIGIR-1987-RaitaT #predict
Predictive Text Compression by Hashing (TR, JT), pp. 223–233.
SOSPSOSP-1987-VargheseL #data type #implementation #performance
Hashed and Hierarchical Timing Wheels: Data Structures for the Efficient Implementation of a Timer Facility (GV, AL), pp. 25–38.
ICLPICLP-1987-BarklundM87 #logic programming
Hash Tables in Logic Programming (JB, HM), pp. 411–427.
PODSPODS-1986-Otoo #multi
Balanced Multidimensional Extendible Hash Tree (EJO), pp. 100–113.
PODSPODS-1986-Robinson #linear #order #statistics #using
Order Preserving Linear Hashing Using Dynamic Key Statistics (JTR), pp. 91–99.
SIGMODSIGMOD-1986-Faloutsos #multi #using
Multiattribute Hashing Using Gray Codes (CF), pp. 227–238.
VLDBVLDB-1986-HsuY #concurrent
Concurrent Operations in Extendible Hashing (MH, WPY), pp. 241–247.
STOCSTOC-1986-KarlinU #implementation #memory management #parallel #performance
Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version) (ARK, EU), pp. 160–168.
PODSPODS-1985-Ellis #concurrent #linear
Concurrency and Linear Hashing (CSE), pp. 1–7.
SIGMODSIGMOD-1985-Kawagoe
Modified Dynamic Hashing (KK), pp. 201–213.
SIGMODSIGMOD-1985-LarsonR
External Perfect Hashing (PÅL, MVR), pp. 190–200.
SIGMODSIGMOD-1985-Otoo #multi
A Multidimensional Digital Hashing Scheme for Files With Composite Keys (EJO), pp. 214–229.
VLDBVLDB-1985-DeWittG #algorithm #multi
Multiprocessor Hash-Based Join Algorithms (DJD, RHG), pp. 151–164.
SIGMODSIGMOD-1984-ValduriezV #multi #using
A Multikey Hashing Scheme Using Predicate Trees (PV, YV), pp. 107–114.
VLDBVLDB-1984-Bratbergsengen #algebra #relational
Hashing Methods and Relational Algebra Operations (KB), pp. 323–333.
VLDBVLDB-1984-KjellbergZ
Cascade Hashing (PK, TUZ), pp. 481–492.
VLDBVLDB-1984-Mullin
Unified Dynamic Hashing (JKM), pp. 473–480.
VLDBVLDB-1984-Otoo #multi
A Mapping Function for the Directory of a Multidimensional Extendible Hashing (EJO), pp. 493–506.
VLDBVLDB-1984-YangD
A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table (WPY, MWD), pp. 245–254.
STOCSTOC-1984-SlotB #on the #performance
On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space (CFS, PvEB), pp. 391–400.
PODSPODS-1983-Ellis #concurrent #distributed
Extendible Hashing for Concurrent Operations and Distributed Data (CSE), pp. 106–116.
PODSPODS-1983-OukselS #linear #multi
Storage Mappings for Multidimensional Linear Dynamic Hashing (AMO, PS), pp. 90–105.
VLDBVLDB-1983-Orenstein #random
A Dynamic Hash File for Random and Sequential Accessing (JAO), pp. 132–141.
VLDBVLDB-1983-TorenvlietB #optimisation #re-engineering
The Reconstruction and Optimization of Trie Hashing Functions (LT, PvEB), pp. 142–156.
PODSPODS-1982-GonnetL
External Hashing with Limited Internal Storage (GHG, PÅL), pp. 256–261.
VLDBVLDB-1982-Larson #linear
A Single-File Version of Linear Hashing with Partial Expansions (PÅL), pp. 300–309.
ICALPICALP-1982-FlajoletS #branch #polynomial #process
A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization (PF, JMS), pp. 239–251.
SIGMODSIGMOD-1981-Litwin
Trie Hashing (WL), pp. 19–29.
VLDBVLDB-1980-Larson #linear
Linear Hashing with Partial Expansions (PÅL), pp. 224–232.
VLDBVLDB-1980-Litwin #linear
Linear Hashing: A New Tool for File and Table Addressing (WL), pp. 212–223.
ICALPICALP-1980-SchmidtS
An Improved Program for Constructing Open Hash Tables (JPS, ES), pp. 569–581.
PLDISCC-1979-GrahamJR
Hashed symbol tables for languages with explicit scope control (SLG, WNJ, OR), pp. 50–57.
VLDBVLDB-1978-Litwin
Virtual Hashing: A Dynamically Changing Hashing (WL), pp. 517–523.
STOCSTOC-1977-CarterW
Universal Classes of Hash Functions (Extended Abstract) (LC, MNW), pp. 106–112.
STOCSTOC-1977-GonnetM #analysis
The Analysis of an Improved Hashing Technique (GHG, JIM), pp. 113–121.
VLDBVLDB-J-1975-Burkhard76 #algorithm #retrieval
Hashing and Trie Algorithms for Partial Match Retrieval (WAB), pp. 175–187.
STOCSTOC-1976-Burkhard #retrieval
Associative Retrieval Trie Hash-Coding (WAB), pp. 211–219.
STOCSTOC-1976-GuibasS #analysis
The Analysis of Double Hashing (Extended Abstract) (LJG, ES), pp. 187–191.
SIGMODSIGMOD-1975-DeutscherST
Distribution-Dependent Hashing Functions and Their Characteristics (RFD, PGS, JPT), pp. 224–236.
STOCSTOC-1975-RosenbergS #array
Hashing Schemes for Extendible Arrays (Extended Arrays) (ALR, LJS), pp. 159–166.
SIGMODSIGFIDET-1971-Knott #retrieval
Expandable Open Addressing Hash Table Storage and Retrieval (GDK), pp. 187–206.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.