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:
queri (48)
process (43)
similar (38)
base (36)
effici (35)

Stem join$ (all stems)

358 papers:

PODSPODS-2015-GuchtWWZ #communication #complexity #distributed #matrix #multi
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication (DVG, RW, DPW, QZ), pp. 199–212.
PODSPODS-2015-HuQT15a #dependence #testing
Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration (XH, MQ, YT), pp. 291–301.
PODSPODS-2015-KhamisNRR #geometry #worst-case
Joins via Geometric Resolutions: Worst-case and Beyond (MAK, HQN, CR, AR), pp. 213–228.
PODSPODS-2015-KoutrisW #complexity #consistency #constraints #query #self
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints (PK, JW), pp. 17–29.
SIGMODSIGMOD-2015-Atre #query
Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins) (MA), pp. 1793–1808.
SIGMODSIGMOD-2015-BarthelsLAK #in memory #using
Rack-Scale In-Memory Join Processing using RDMA (CB, SL, GA, DK), pp. 1463–1475.
SIGMODSIGMOD-2015-ChuBS #database #evaluation #parallel #performance #query #theory and practice
From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System (SC, MB, DS), pp. 63–78.
SIGMODSIGMOD-2015-DugganPBS #array #database #optimisation
Skew-Aware Join Optimization for Array Databases (JD, OP, LB, MS), pp. 123–135.
SIGMODSIGMOD-2015-LiHDL #multi #performance #similarity
Efficient Similarity Join and Search on Multi-Attribute Data (GL, JH, DD, JL), pp. 1137–1151.
SIGMODSIGMOD-2015-LinOWY #distributed #scalability
Scalable Distributed Stream Join Processing (QL, BCO, ZW, CY), pp. 811–825.
SIGMODSIGMOD-2015-TauheedHA #named #scalability
THERMAL-JOIN: A Scalable Spatial Join for Dynamic Workloads (FT, TH, AA), pp. 939–950.
SIGMODSIGMOD-2015-ZhengZLYSZ #approach #graph #how #nondeterminism #rdf #similarity
How to Build Templates for RDF Question/Answering: An Uncertain Graph Similarity Join Approach (WZ, LZ, XL, JXY, SS, DZ), pp. 1809–1824.
VLDBVLDB-2015-HeGC #corpus #named #semantics #using
SEMA-JOIN: Joining Semantically-Related Tables Using Big Table Corpora (YH, KG, XC), pp. 1358–1369.
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.
VLDBVLDB-2015-KhayyatLSOPQ0K #difference #performance
Lightning Fast and Space Efficient Inequality Joins (ZK, WL, MS, MO, PP, JAQR, NT, PK), pp. 2074–2085.
VLDBVLDB-2015-KimmettST #case study #fuzzy #pipes and filters
Fuzzy Joins in MapReduce: An Experimental Study (BK, VS, AT), pp. 1514–1525.
VLDBVLDB-2015-TangCM #scalability #similarity
Scaling Similarity Joins over Tree-Structured Data (YT, YC, NM), pp. 1130–1141.
VLDBVLDB-2015-VengerovMZC #estimation
Join Size Estimation Subject to Filter Conditions (DV, ACM, MZ, SC), pp. 1530–1541.
HCIHCI-DE-2015-BoscarioliBSB #challenge #concept #education #how #human-computer #industrial
How to Join Theoretical Concepts, Industry Needs and Innovative Technologies in HCI Courses? The Big Challenge of Teaching HCI (CB, SAB, MSS, SDJB), pp. 27–36.
ECIRECIR-2015-HopfgartnerB #realtime #recommendation
Join the Living Lab: Evaluating News Recommendations in Real-Time (FH, TB), pp. 826–829.
SIGIRSIGIR-2015-Liu #mobile
WeChat Search & Headline: Sogou Joins Force with Tencent on Mobile Search (CL), p. 1079.
SACSAC-2015-EvangelistaFBA #named #symmetry
Bt-Join: a join operator for asymmetric storage device (NLE, JdAMF, AB, NA), pp. 988–993.
SACSAC-2015-SidneyMRH #performance #predict #set #similarity
Performance prediction for set similarity joins (CFS, DSM, LAR, TH), pp. 967–972.
CAVCAV-2015-MasciOZJCT #human-computer
PVSio-web 2.0: Joining PVS to HCI (PM, PO, YZ, PLJ, PC, HWT), pp. 470–478.
PODSPODS-2014-NgoNRR #analysis #worst-case
Beyond worst-case analysis for joins with minesweeper (HQN, DTN, CR, AR), pp. 234–245.
SIGMODSIGMOD-2014-AugstenM0K #database #on the fly #relational #similarity
On-the-fly token similarity joins in relational databases (NA, AM, TN, AK), pp. 1495–1506.
SIGMODSIGMOD-2014-DignosBG
Overlap interval partition join (AD, MHB, JG), pp. 1459–1470.
SIGMODSIGMOD-2014-PatilS #nondeterminism #similarity #string
Similarity joins for uncertain strings (MP, RS), pp. 1471–1482.
SIGMODSIGMOD-2014-PolychroniouSR #distributed #network
Track join: distributed joins with minimal network traffic (OP, RS, KAR), pp. 1483–1494.
SIGMODSIGMOD-2014-TaoL #performance #similarity
Efficient top-K SimRank-based similarity join (WT, GL), pp. 1603–1604.
SIGMODSIGMOD-2014-TranNST #approach #clustering #named
JECB: a join-extension, code-based approach to OLTP data partitioning (KQT, JFN, BS, DT), pp. 39–50.
VLDBVLDB-2014-BonifatiCS #interactive #query
Interactive Join Query Inference with JIM (AB, RC, SS), pp. 1541–1544.
VLDBVLDB-2014-BrunoKW #distributed #scalability
Advanced Join Strategies for Large-Scale Distributed Computation (NB, YK, MCW), pp. 1484–1495.
VLDBVLDB-2014-ElseidyEVK #adaptation #online #scalability
Scalable and Adaptive Online Joins (ME, AE, AV, CK), pp. 441–452.
VLDBVLDB-2014-JiangLFL #evaluation #similarity #string
String Similarity Joins: An Experimental Evaluation (YJ, GL, JF, WSL), pp. 625–636.
VLDBVLDB-2014-LeeABCDHI0LLMMPQRSSSZ
Joins on Encoded and Partitioned Data (JGL, GKA, RB, NC, OD, FH, SI, MSK, SL, GML, KM, KM, IP, LQ, VR, VKS, RS, KS, LZ), pp. 1355–1366.
VLDBVLDB-2014-NtarmosPT #database #query #rank
Rank Join Queries in NoSQL Databases (NN, IP, PT), pp. 493–504.
VLDBVLDB-2014-RoyTG
Low-Latency Handshake Join (PR, JT, RG), pp. 709–720.
VLDBVLDB-2014-SarmaHC #clustering #framework #named #similarity #using
ClusterJoin: A Similarity Joins Framework using Map-Reduce (ADS, YH, SC), pp. 1059–1070.
VLDBVLDB-2014-ShanbhagS #optimisation #query
Optimizing Join Enumeration in Transformation-based Query Optimizers (AS, SS), pp. 1243–1254.
VLDBVLDB-2014-VemuriVPL #execution #scalability
Execution Primitives for Scalable Joins and Aggregations in Map Reduce (SV, MV, KP, RL), pp. 1462–1473.
VLDBVLDB-2014-Viglas #memory management #persistent
Write-limited sorts and joins for persistent memory (SV), pp. 413–424.
VLDBVLDB-2015-BarberLPRSACLS14
Memory-Efficient Hash Joins (RB, GML, IP, VR, RS, GKA, NC, SL, DS), pp. 353–364.
VLDBVLDB-2015-SidlauskasJ14 #exclamation #implementation #in memory #matter #memory management
Spatial Joins in Main Memory: Implementation Matters! (DS, CSJ), pp. 97–100.
VLDBVLDB-2015-TaoYL14 #performance #similarity
Efficient Top-K SimRank-based Similarity Join (WT, MY, GL), pp. 317–328.
ESOPESOP-2014-MangalNY #analysis #interprocedural
A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of Join (RM, MN, HY), pp. 513–533.
FMFM-2014-FengZ #automaton #bisimulation #equivalence #probability
When Equivalence and Bisimulation Join Forces in Probabilistic Automata (YF, LZ), pp. 247–262.
CIKMCIKM-2014-ChengKWT #parallel #robust
Robust and Skew-resistant Parallel Joins in Shared-Nothing Systems (LC, SK, TEW, GT), pp. 1399–1408.
LOPSTRLOPSTR-2014-Balaniuk #induction #synthesis
Drill and Join: A Method for Exact Inductive Program Synthesis (RB), pp. 219–237.
SACSAC-2014-RaigozaS
Temporal join processing with hilbert curve space mapping (JR, JS), pp. 839–844.
DATEDATE-2013-OjailDLG #embedded #framework #lightweight #manycore #named
ARTM: a lightweight fork-join framework for many-core embedded systems (MO, RD, YL, AG), pp. 1510–1515.
SIGMODSIGMOD-2013-AnanthanarayananBDGJQRRSV #data type #fault tolerance #named #scalability
Photon: fault-tolerant and scalable joining of continuous data streams (RA, VB, SD, AG, HJ, TQ, AR, DR, MS, SV), pp. 577–588.
SIGMODSIGMOD-2013-ChenZ #difference #privacy #recursion #strict #towards
Recursive mechanism: towards node differential privacy and unrestricted joins (SC, SZ), pp. 653–664.
SIGMODSIGMOD-2013-LuLWLW #metric #similarity #string
String similarity measures and joins with synonyms (JL, CL, WW, CL, HW), pp. 373–384.
SIGMODSIGMOD-2013-NobariTHKBA #clustering #in memory #named
TOUCH: in-memory spatial join by hierarchical data-oriented partitioning (SN, FT, TH, PK, SB, AA), pp. 701–712.
SIGMODSIGMOD-2013-WangLKFF #crowdsourcing #transitive
Leveraging transitive relations for crowdsourced joins (JW, GL, TK, MJF, JF), pp. 229–240.
SIGMODSIGMOD-2013-ZhangEPS #query #reverse engineering
Reverse engineering complex join queries (MZ, HE, CMP, DS), pp. 809–820.
VLDBVLDB-2013-FenderM #top-down
Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs (PF, GM), pp. 1822–1833.
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-NagendraC #framework #named
SkySuite: A Framework of Skyline-Join Operators for Static and Stream Environments (MN, KSC), pp. 1266–1269.
VLDBVLDB-2013-SowellSCDG #analysis #in memory #memory management
An Experimental Analysis of Iterated Spatial Joins in Main Memory (BS, MAVS, TC, AJD, JG), pp. 1882–1893.
VLDBVLDB-2013-ZhengZF0Z #graph #performance #scalability #similarity
Efficient SimRank-based Similarity Join Over Large Graphs (WZ, LZ, YF, LC, DZ), pp. 493–504.
VLDBVLDB-2014-BalkesenATO13 #in memory #manycore #revisited
Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited (CB, GA, JT, MTÖ), pp. 85–96.
SEFMSEFM-2013-TranST #composition #static analysis #transaction
Compositional Static Analysis for Implicit Join Synchronization in a Transactional Setting (TMTT, MS, HT), pp. 212–228.
HCIDUXU-NTE-2013-ArningZM #design #exclamation #framework #guidelines #interface #requirements
Join the Ride! User Requirements and Interface Design Guidelines for a Commuter Carpooling Platform (KA, MZ, HM), pp. 10–19.
HCIHCI-UC-2013-GuercioMBL #education #experience #named #network #social
SOCIETY: A Social Reading Application to Join Education and Social Network Experience (EG, FLM, MB, LL), pp. 277–284.
ICEISICEIS-J-2013-GiordanoTSAF13a #approach #architecture #case study #enterprise #ontology #semantics
Joining Data and Maps in the Government Enterprise Architecture by a Semantic Approach: Methodology, Ontology and Case Study (DG, AT, CS, SA, AF), pp. 506–519.
ICEISICEIS-J-2013-HendersonL13a #database #evaluation #multi #relational
An Evaluation of Multi-way Joins for Relational Database Systems (MH, RL), pp. 37–50.
ICEISICEIS-v1-2013-HendersonL #multi #question
Are Multi-way Joins Actually Useful? (MH, RL), pp. 13–22.
CIKMCIKM-2013-DerakhshanSS #data type #performance #streaming
A new operator for efficient stream-relation join processing in data streaming engines (RD, AS, BS), pp. 793–798.
RecSysRecSys-2013-SchelterBSAM #distributed #matrix #pipes and filters #using
Distributed matrix factorization with mapreduce using a series of broadcast-joins (SS, CB, MS, AA, VM), pp. 281–284.
ECOOPECOOP-2013-SvendsenBP #case study #composition #concurrent #higher-order #library #named #specification
Joins: A Case Study in Modular Specification of a Concurrent Reentrant Higher-Order Library (KS, LB, MJP), pp. 327–351.
SACSAC-2013-ValsomatzisG #in memory #multi
Driver input selection for main-memory multi-way joins (EV, AG), pp. 818–825.
PODSPODS-2012-NgoPRR #algorithm #worst-case
Worst-case optimal join algorithms: [extended abstract] (HQN, EP, CR, AR), pp. 37–48.
SIGMODSIGMOD-2012-BegleyHC #database #in memory #named
MCJoin: a memory-constrained join for column-store main-memory databases (SKB, ZH, YPPC), pp. 121–132.
SIGMODSIGMOD-2012-OhKKL #sorting
Reducing cache misses in hash join probing phase by pre-sorting strategy (abstract only) (GHO, JMK, WHK, SWL), p. 864.
SIGMODSIGMOD-2012-SilvaR #similarity
Exploiting MapReduce-based similarity joins (YNS, JMR), pp. 693–696.
SIGMODSIGMOD-2012-WangLF #adaptation #framework #similarity
Can we beat the prefix filtering?: an adaptive framework for similarity join and search (JW, GL, JF), pp. 85–96.
VLDBVLDB-2012-AlbutiuKN #database #in memory #manycore #memory management #parallel
Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems (MCA, AK, TN), pp. 1064–1075.
VLDBVLDB-2012-LuSCO #nearest neighbour #performance #pipes and filters #using
Efficient Processing of k Nearest Neighbor Joins using MapReduce (WL, YS, SC, BCO), pp. 1016–1027.
VLDBVLDB-2012-MetwallyF #framework #multi #named #pipes and filters #scalability #similarity
V-SMART-Join: A Scalable MapReduce Framework for All-Pair Similarity Joins of Multisets and Vectors (AM, CF), pp. 704–715.
VLDBVLDB-2012-SilvaP #database #metric #similarity
Exploiting Database Similarity Joins for Metric Spaces (YNS, SP), pp. 1922–1925.
VLDBVLDB-2012-ZhangCW #multi #performance #pipes and filters #using
Efficient Multi-way Theta-Join Processing Using MapReduce (XZ, LC, MW), pp. 1184–1195.
VLDBVLDB-2013-BourosGM12 #similarity
Spatio-textual similarity joins (PB, SG, NM), pp. 1–12.
SASSAS-2012-CalvertM #analysis #calculus #control flow
Control Flow Analysis for the Join Calculus (PC, AM), pp. 181–197.
CIKMCIKM-2012-LiuLF #named #similarity
Star-Join: spatio-textual similarity join (SL, GL, JF), pp. 2194–2198.
ICPRICPR-2012-AmornbunchornvejLAIT #algorithm #clustering
Iterative Neighbor-Joining tree clustering algorithm for genotypic data (CA, TL, AA, AI, ST), pp. 1827–1830.
ICPRICPR-2012-MartelliCBTM #detection #paradigm #similarity
Joining feature-based and similarity-based pattern description paradigms for object detection (SM, MC, LB, DT, VM), pp. 2702–2705.
PADLPADL-2012-CampagnaSS #approximate #constraints #datalog #difference #optimisation
Optimizing Inequality Joins in Datalog with Approximated Constraint Propagation (DC, BSS, TS), pp. 108–122.
OSDIOSDI-2012-NarayanH #database #distributed #named #query
DJoin: Differentially Private Join Queries over Distributed Databases (AN, AH), pp. 149–162.
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.
SIGMODSIGMOD-2011-LinACOW #framework #named #pipes and filters #scalability
Llama: leveraging columnar storage for scalable join processing in the MapReduce framework (YL, DA, CC, BCO, SW), pp. 961–972.
SIGMODSIGMOD-2011-OkcanR #pipes and filters #using
Processing theta-joins using MapReduce (AO, MR), pp. 949–960.
SIGMODSIGMOD-2011-TeubnerM #how
How soccer players would do stream joins (JT, RM), pp. 625–636.
SIGMODSIGMOD-2011-VlachouDP #query
Skyline query processing over joins (AV, CD, NP), pp. 73–84.
VLDBVLDB-2011-LeeNS #estimation #locality #similarity #using
Similarity Join Size Estimation using Locality Sensitive Hashing (HL, RTN, KS), pp. 338–349.
VLDBVLDB-2011-MoerkotteN #query
Accelerating Queries with Group-By and Join by Groupjoin (GM, TN), pp. 843–851.
VLDBVLDB-2011-SunCLCH #on the #similarity
On Link-based Similarity Join (LS, RC, XL, DWC, JH), pp. 714–725.
VLDBVLDB-2011-XieLW #constraints #performance #rank
Efficient Rank Join with Aggregation Constraints (MX, LVSL, PTW), pp. 1201–1212.
VLDBVLDB-2012-LiDWF11 #named #similarity
PASS-JOIN: A Partition-based Method for Similarity Joins (GL, DD, JW, JF), pp. 253–264.
VLDBVLDB-2012-MarcusWKMM11
Human-powered Sorts and Joins (AM, EW, DRK, SM, RCM), pp. 13–24.
ICPCICPC-2011-FabryKD #named #scalability #visualisation
AspectMaps: A Scalable Visualization of Join Point Shadows (JF, AK, SD), pp. 121–130.
ICPCICPC-2011-SteinH #aspect-oriented #comparison #constraints #empirical #visual notation
Comparison of a Visual and a Textual Notation to Express Data Constraints in Aspect-Oriented Join Point Selections: A Controlled Experiment (DS, SH), pp. 141–150.
ICEISICEIS-v1-2011-BiniLSSA #algorithm
Non-exhaustive Join Ordering Search Algorithms for LJQO (TAB, AL, MSS, FS, ECdA), pp. 151–156.
CIKMCIKM-2011-0003L #rdf
Estimating selectivity for joined RDF triple patterns (HH, CL), pp. 1435–1444.
CIKMCIKM-2011-LadwigT #algorithm #database #keyword
Index structures and top-k join algorithms for native keyword search databases (GL, TT), pp. 1505–1514.
SIGIRSIGIR-2011-ZhouCZ #algorithm #approximate #named #performance #string #towards
SEJoin: an optimized algorithm towards efficient approximate string searches (JZ, ZC, JZ), pp. 1249–1250.
OOPSLAOOPSLA-2011-TuronR #scalability
Scalable join patterns (AJT, CVR), pp. 575–594.
SACSAC-2011-GroppeG #database #query #scalability #semantics #web
Parallelizing join computations of SPARQL queries for large semantic web databases (JG, SG), pp. 1681–1686.
ESEC-FSEESEC-FSE-2011-InostrozaTB #aspect-oriented #composition #interface #reasoning #source code
Join point interfaces for modular reasoning in aspect-oriented programs (MI, ÉT, EB), pp. 508–511.
SLESLE-2011-NishimoriK #framework #game studies #programming
Join Token-Based Event Handling: A Comprehensive Framework for Game Programming (TN, YK), pp. 119–138.
VMCAIVMCAI-2011-GawlitzaLMSW #analysis #concurrent #process #reachability #source code
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (TMG, PL, MMO, HS, AW), pp. 199–213.
SIGMODSIGMOD-2010-BlanasPERST #algorithm #comparison #pipes and filters
A comparison of join algorithms for log processing in MaPreduce (SB, JMP, VE, JR, EJS, YT), pp. 975–986.
SIGMODSIGMOD-2010-ChenGN #named #statistics
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees (SC, PBG, SN), pp. 147–158.
SIGMODSIGMOD-2010-JestesLYY #probability #similarity #string
Probabilistic string similarity joins (JJ, FL, ZY, KY), pp. 327–338.
SIGMODSIGMOD-2010-SternBB #approach #network #query
Processing continuous join queries in sensor networks: a filtering approach (MS, KB, EB), pp. 267–278.
SIGMODSIGMOD-2010-VernicaCL #parallel #performance #pipes and filters #using
Efficient parallel set-similarity joins using MapReduce (RV, MJC, CL), pp. 495–506.
VLDBVLDB-2010-GrimsmoBH #performance
Fast Optimal Twig Joins (NG, TAB, MLH), pp. 894–905.
VLDBVLDB-2010-LianC #probability #set #similarity
Set Similarity Join on Probabilistic Data (XL, LC), pp. 650–659.
VLDBVLDB-2010-MartinenghiT #proximity #rank
Proximity Rank Join (DM, MT), pp. 352–363.
VLDBVLDB-2010-MihaylovJIG #multi #network #optimisation
Dynamic Join Optimization in Multi-Hop Wireless Sensor Networks (SRM, MJ, ZGI, SG), pp. 1279–1290.
VLDBVLDB-2010-WangLF #constraints #named #performance #similarity #string
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints (JW, GL, JF), pp. 1219–1230.
VLDBVLDB-2010-WuBMPS #query
Processing Top-k Join Queries (MW, LBE, AM, CMP, DS), pp. 860–870.
SEFMSEFM-2010-KatzK #query #refinement #specification
User Queries for Specification Refinement Treating Shared Aspect Join Points (EK, SK), pp. 73–82.
ICEISICEIS-HCI-2010-AstolfiMSA #difference #enterprise #people #problem #using
Using Cultural Differences to Join People with Common Interests or Problems in Enterprise Environment (GA, VMAdM, MARS, JCA), pp. 192–197.
ICEISICEIS-HCI-2010-FortunaBB #ajax #flexibility #framework #interface
A Framework for Flexibility at the Interface — Joining Ajax Technology and Semiotics (FJF, RB, MCCB), pp. 30–37.
CIKMCIKM-2010-LiSWZD #approximate #locality
Approximate membership localization (AML) for web-based join (ZL, LS, LW, XZ, XD), pp. 1321–1324.
CIKMCIKM-2010-ShalemK
Computing the top-k maximal answers in a join of ranked lists (MS, YK), pp. 1381–1384.
CIKMCIKM-2010-ZhangGGZS #named #similarity
CasJoin: a cascade chain for text similarity joins (XZ, ZG, HG, HZ, ZS), pp. 1725–1728.
SACSAC-2010-HassanB #distributed #file system #using
Semi-join computation on distributed file systems using map-reduce-merge model (MAHH, MB), pp. 406–413.
PPoPPPPoPP-2010-AgrawalLS #parallel #programming
Helper locks for fork-join parallel programming (KA, CEL, JS), pp. 245–256.
PODSPODS-2009-RastogiHMS #privacy #query
Relationship privacy: output perturbation for queries with joins (VR, MH, GM, DS), pp. 107–116.
SIGMODSIGMOD-2009-ChenCMPSS #database #optimisation #order
Partial join order optimization in the paraccel analytic database (YC, RLC, WJM, SP, AS, ESJ), pp. 905–908.
SIGMODSIGMOD-2009-FingerP #algorithm #evaluation #performance #rank #robust
Robust and efficient algorithms for rank join evaluation (JF, NP), pp. 415–428.
SIGMODSIGMOD-2009-Neumann #optimisation #query
Query simplification: graceful degradation for join-order optimization (TN0), pp. 403–414.
SIGMODSIGMOD-2009-NeumannW #graph #rdf #scalability
Scalable join processing on very large RDF graphs (TN, GW), pp. 627–640.
SIGMODSIGMOD-2009-YangPPK #authentication #database #outsourcing
Authenticated join processing in outsourced databases (YY, DP, SP, PK), pp. 5–18.
VLDBVLDB-2009-CandeaPV #concurrent #predict #scalability
A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses (GC, NP, RV), pp. 277–288.
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.
VLDBVLDB-2009-LeeNS #estimation #set #similarity
Power-Law Based Estimation of Set Similarity Join Size (HL, RTN, KS), pp. 658–669.
VLDBVLDB-2009-XuK #parallel #performance
Efficient Outer Join Data Skew Handling in Parallel DBMS (YX, PK), pp. 1390–1396.
VLDBVLDB-2009-ZouCO #database #graph #named #query #scalability
DistanceJoin: Pattern Match Query In a Large Graph Database (LZ, LC, MTÖ), pp. 886–897.
CIKMCIKM-2009-DaiZ #constraints #distance #edit distance #incremental #similarity
Incremental similarity joins with edit distance constraints (DD, GZ), pp. 1449–1452.
CIKMCIKM-2009-FletcherB #graph #performance #rdf #scalability
Scalable indexing of RDF graphs for efficient join processing (GHLF, PWB), pp. 1513–1516.
CIKMCIKM-2009-LianC #data type #nondeterminism #performance
Efficient join processing on uncertain data streams (XL, LC), pp. 857–866.
CIKMCIKM-2009-MadduriW #performance
Efficient joins with compressed bitmap indexes (KM, KW), pp. 1017–1026.
TOOLSTOOLS-EUROPE-2009-StrickerHS #constraints #design #diagrams #uml #using
Designing Design Constraints in the UML Using Join Point Designation Diagrams (VS, SH, DS), pp. 57–76.
GPCEGPCE-2009-Sadat-MohtashamH #transaction
Transactional pointcuts: designation reification and advice of interrelated join points (SHSM, HJH), pp. 35–44.
SACSAC-2009-GroppeGEL #in memory #memory management #performance #strict
Efficient processing of SPARQL joins in memory by dynamically restricting triple patterns (JG, SG, SE, VL), pp. 1231–1238.
SACSAC-2009-HendersonCL #performance
Exploiting join cardinality for faster hash joins (MH, BC, RL), pp. 1549–1554.
PODSPODS-2008-SchnaitterP #rank
Evaluating rank joins with optimal cost (KS, NP), pp. 43–52.
SIGMODSIGMOD-2008-HeYFLGLS #relational
Relational joins on graphics processors (BH, KY, RF, ML, NKG, QL, PVS), pp. 511–524.
SIGMODSIGMOD-2008-XuKZC #parallel
Handling data skew in parallel joins in shared-nothing systems (YX, PK, XZ, LC), pp. 1043–1052.
VLDBVLDB-2008-ChandramouliY #scalability
End-to-end support for joins in large-scale publish/subscribe systems (BC, JY), pp. 434–450.
VLDBVLDB-2008-XiaoWL #algorithm #constraints #distance #edit distance #named #performance #similarity
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints (CX, WW, XL), pp. 933–944.
OOPSLAOOPSLA-2008-Russo #visual notation
Join patterns for visual basic (CVR), pp. 53–72.
SACSAC-2008-GybelsHD
Symbiosis in logic-based pointcuts over a history of join points (KG, CH, TD), pp. 253–260.
PODSPODS-2007-KimelfeldS #probability
Maximally joining probabilistic data (BK, YS), pp. 303–312.
SIGMODSIGMOD-2007-DeHaanT #top-down
Optimal top-down join enumeration (DD, FWT), pp. 785–796.
SIGMODSIGMOD-2007-HongDGKRW #multi
Massively multi-query join processing in publish/subscribe systems (MH, AJD, JG, CK, MR, WMW), pp. 761–772.
VLDBVLDB-2007-GedikYB
Executing Stream Joins on the Cell Processor (BG, PSY, RB), pp. 363–374.
VLDBVLDB-2007-QiCS #graph #query
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs (YQ, KSC, MLS), pp. 507–518.
SASSAS-2007-ShohamG #abstraction #composition #verification
Compositional Verification and 3-Valued Abstractions Join Forces (SS, OG), pp. 69–86.
CAiSECAiSE-2007-MendlingA #formal method #verification
Formalization and Verification of EPCs with OR-Joins Based on State and Context (JM, WMPvdA), pp. 439–453.
EDOCEDOC-2007-MendlingDA #modelling #process
Getting Rid of the OR-Join in Business Process Models (JM, BFvD, WMPvdA), pp. 3–14.
ICEISICEIS-DISI-2007-GorawskiG #approach #distributed #query
Distributed approach of continuous queries with knn join processing in spatial data warehouse (MG, WG), pp. 131–136.
ICEISICEIS-DISI-2007-GroppeGL #order #using
Using an index of precomputed joins in order to speed up SPARQL processing (SG, JG, VL), pp. 13–20.
CIKMCIKM-2007-Pereira #learning
Learning to join everything (FP0), pp. 9–10.
PADLPADL-2007-Russo #concurrent #library
The Joins Concurrency Library (CVR), pp. 260–274.
PODSPODS-2006-PaghP #scalability
Scalable computation of acyclic joins (AP, RP), pp. 225–232.
SIGMODSIGMOD-2006-MathisHH #query #xml
Locking-aware structural join operators for XML query processing (CM, TH, MPH), pp. 467–478.
VLDBVLDB-2006-ArasuGK #performance
Efficient Exact Set-Similarity Joins (AA, VG, RK), pp. 918–929.
VLDBVLDB-2006-KoudasLTV #query
Relaxing Join and Selection Queries (NK, CL, AKHT, RV), pp. 199–210.
VLDBVLDB-2006-LiCTACH #data type #query #safety
Safety Guarantee of Continuous Join Queries over Punctuated Data Streams (HGL, SC, JT, DA, KSC, WPH), pp. 19–30.
VLDBVLDB-2006-MoerkotteN #algorithm #analysis #generative #programming
Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products (GM, TN), pp. 930–941.
DLTDLT-2006-JonoskaKM
Involution Solid and Join Codes (NJ, LK, KM), pp. 192–202.
CIKMCIKM-2006-ChengSPSVX #nondeterminism #performance
Efficient join processing over uncertain data (RC, SS, SP, RS, JSV, YX), pp. 738–747.
CIKMCIKM-2006-HeL
Cache-oblivious nested-loop joins (BH, QL), pp. 718–727.
CIKMCIKM-2006-JiangLH #algorithm #performance #xml
An efficient one-phase holistic twig join algorithm for XML data (ZJ, CL, WCH), pp. 786–787.
CIKMCIKM-2006-OjewoleZH #approximate #data type #semantics
Window join approximation over data streams with importance semantics (AO, QZ, WCH), pp. 112–121.
SACSAC-2006-BernsteinK #ontology #retrieval #similarity #towards #using
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins (AB, CK), pp. 1684–1689.
SACSAC-2006-CazzolaCP #modelling #towards
Towards a model-driven join point model (WC, AC, AP), pp. 1306–1307.
PODSPODS-2005-Dobra #approximate #question
Histograms revisited: when are histograms the best approximation method for aggregates over joins? (AD), pp. 228–237.
PODSPODS-2005-GangulyGKR #estimation
Join-distinct aggregate estimation over update streams (SG, MNG, AK, RR), pp. 259–270.
PODSPODS-2005-LeindersB #algebra #complexity #on the #relational #set
On the complexity of division and set joins in the relational algebra (DL, JVdB), pp. 76–83.
SIGMODSIGMOD-2005-CataniaWOW #lazy evaluation #performance #xml
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency (BC, WQW, BCO, XW), pp. 515–526.
SIGMODSIGMOD-2005-JermaineDAJP #probability
A Disk-Based Join With Probabilistic Guarantees (CJ, AD, SA, SJ, AP), pp. 563–574.
SIGMODSIGMOD-2005-TaoYPMH #named #optimisation #performance
RPJ: Producing Fast Join Results on Streams through Rate-based Optimization (YT, MLY, DP, MH, NM), pp. 371–382.
SIGMODSIGMOD-2005-XieYC #on the #probability
On Joining and Caching Stochastic Streams (JX, JY, YC), pp. 359–370.
VLDBVLDB-2005-ChenAGM
Inspector Joins (SC, AA, PBG, TCM), pp. 817–828.
VLDBVLDB-2005-KoudasS #approximate #concept
Approximate Joins: Concepts and Techniques (NK, DS), p. 1363.
VLDBVLDB-2005-LarsonZ
View Matching for Outer-Join Views (PÅL, JZ), pp. 445–456.
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.
VLDBVLDB-2005-LiuR #parallel #pipes and filters #query
Revisiting Pipelined Parallelism in Multi-Join Query Processing (BL, EAR), pp. 829–840.
ICALPICALP-2005-EliasL #performance
Fast Neighbor Joining (IE, JL), pp. 1263–1274.
ICEISICEIS-v1-2005-KostowskiC #evaluation
Analytical and Experimental Evaluation of Stream-based Join (HK, KTC), pp. 154–161.
ICEISICEIS-v5-2005-KriegelKPR #performance
Efficient Join Processing for Complex Rasterized Objects (HPK, PK, MP, MR), pp. 20–30.
ICEISICEIS-v5-2005-MasonWL #named #specification
Autojoin: Providing Freedom from Specifying Joins (TM, LW, RL), pp. 31–38.
CIKMCIKM-2005-FontouraJSY #optimisation
Optimizing cursor movement in holistic twig joins (MF, VJ, EJS, BY), pp. 784–791.
CIKMCIKM-2005-GedikWYL #adaptation
Adaptive load shedding for windowed stream joins (BG, KLW, PSY, LL), pp. 171–178.
CIKMCIKM-2005-LuoJH #estimation
Applying cosine series to join size estimation (CL, ZJ, WCH), pp. 227–228.
GPCEGPCE-2005-WuL #programming #reasoning #source code #using
Shadow Programming: Reasoning About Programs Using Lexical Join Point Information (PW, KJL), pp. 141–156.
ESEC-FSEESEC-FSE-2005-FischerJM #data flow
Joining dataflow with predicates (JF, RJ, RM), pp. 227–236.
SIGMODSIGMOD-2004-EnderleHS #database #relational
Joining Interval Data in Relational Databases (JE, MH, TS), pp. 683–694.
SIGMODSIGMOD-2004-Sarawagi #performance #set #similarity
Efficient set joins on similarity predicates (SS, AK), pp. 743–754.
VLDBVLDB-2004-MayerGKT #injection
An Injection of Tree Awareness: Adding Staircase Join to PostgreSQL (SM, TG, MvK, JT), pp. 1305–1308.
VLDBVLDB-2004-SrivastavaW #execution
Memory-Limited Execution of Windowed Stream Joins (US, JW), pp. 324–335.
VLDBVLDB-2004-XiaLOH #named #performance
Gorder: An Efficient Method for KNN Join Processing (CX, HL, BCO, JH), pp. 756–767.
CIKMCIKM-2004-DingR
Evaluating window joins over punctuated streams (LD, EAR), pp. 98–107.
CIKMCIKM-2004-YangFSRB #xml
Virtual cursors for XML joins (BY, MF, EJS, SR, KSB), pp. 523–532.
HPDCHPDC-2004-VijayakumarP #data type #evaluation #performance
Performance Evaluation of Rate-Based Join Window Sizing for Asynchronous Data Streams (NNV, BP), pp. 260–261.
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.
PODSPODS-2003-DittrichSTW #on the
On producing join results early (JPD, BS, DST, PW), pp. 134–142.
SIGMODSIGMOD-2003-DasGR #approximate #data type
Approximate Join Processing Over Data Streams (AD, JG, MR), pp. 40–51.
SIGMODSIGMOD-2003-Mamoulis #performance
Efficient Processing of Joins on Set-valued Attributes (NM), pp. 157–168.
SIGMODSIGMOD-2003-SunAA #hardware
Hardware Acceleration for Spatial Selections and Joins (CS, DA, AEA), pp. 455–466.
SIGMODSIGMOD-2003-WangJLY #estimation #modelling
Containment Join Size Estimation: Models and Methods (WW, HJ, HL, JXY), pp. 145–156.
VLDBVLDB-2003-GolabO #data type #multi #query
Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams (LG, MTÖ), pp. 500–511.
VLDBVLDB-2003-GrustKT #education #relational
Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps (TG, MvK, JT), pp. 524–525.
VLDBVLDB-2003-HammadFAE #data type #scheduling
Scheduling for shared window joins over data streams (MAH, MJF, WGA, AKE), pp. 297–308.
VLDBVLDB-2003-IlyasAE #database #query #relational
Supporting Top-k Join Queries in Relational Databases (IFI, WGA, AKE), pp. 754–765.
VLDBVLDB-2003-JiangWL #documentation #xml
Holistic Twig Joins on Indexed XML Documents (HJ, WW, HL, JXY), pp. 273–284.
VLDBVLDB-2003-LuoNEW #protocol
Locking Protocols for Materialized Aggregate Join Views (GL, JFN, CJE, MW), pp. 596–607.
VLDBVLDB-2003-ViglasNB #multi #query #streaming
Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources (SV, JFN, JB), pp. 285–296.
ECIRECIR-2003-DohnalGSZ #metric #similarity
Similarity Join in Metric Spaces (VD, CG, PS, PZ), pp. 452–467.
SACSAC-2003-ChenC #named
Similar_Join: Extending DBMS with a Bio-specific Operator (JYC, JVC), pp. 109–114.
PPoPPPPoPP-2003-TauraKEY #named #parallel #programming
Phoenix: a parallel programming model for accommodating dynamically joining/leaving resources (KT, KK, TE, AY), pp. 216–229.
SIGMODSIGMOD-2002-BrunoKS #pattern matching #xml
Holistic twig joins: optimal XML pattern matching (NB, NK, DS), pp. 310–321.
SIGMODSIGMOD-2002-GuhaJKSY #approximate #xml
Approximate XML joins (SG, HVJ, NK, DS, TY), pp. 287–298.
SIGMODSIGMOD-2002-LiGS
Skew handling techniques in sort-merge join (WL, DG, RTS), pp. 169–180.
SIGMODSIGMOD-2002-LuoEHN #algorithm #scalability
A scalable hash ripple join algorithm (GL, CJE, PJH, JFN), pp. 252–262.
SIGMODSIGMOD-2002-Weininger #execution #performance
Efficient execution of joins in a star schema (AW), pp. 542–545.
VLDBVLDB-2002-ChienVZTZ #documentation #performance #xml
Efficient Structural Joins on Indexed XML Documents (SYC, ZV, DZ, VJT, CZ), pp. 263–274.
VLDBVLDB-2002-DittrichSTW #algorithm
Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm (JPD, BS, DST, PW), pp. 299–310.
VLDBVLDB-2002-IlyasAE
Joining Ranked Inputs in Practice (IFI, WGA, AKE), pp. 950–961.
PODSPODS-2001-CaiCKN #complexity #on the
On the Complexity of Join Predicates (JyC, VTC, RK, JFN).
VLDBVLDB-2001-GravanoIJKMS #approximate #database #for free #string
Approximate String Joins in a Database (Almost) for Free (LG, PGI, HVJ, NK, SM, DS), pp. 491–500.
VLDBVLDB-2001-NatsevCSLV #incremental #query
Supporting Incremental Join Queries on Ranked Inputs (AN, YCC, JRS, CSL, JSV), pp. 281–290.
ESOPESOP-2001-ConchonP #calculus #constraints #type inference
JOIN(X): Constraint-Based Type Inference for the Join-Calculus (SC, FP), pp. 221–236.
FoSSaCSFoSSaCS-2001-BuscemiS #calculus #petri net
High-Level Petri Nets as Type Theories in the Join Calculus (MGB, VS), pp. 104–120.
KDDKDD-2001-DittrichS #algorithm #mining #named #scalability #set
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces (JPD, BS), pp. 47–56.
GPCESAIG-2001-Wand #aspect-oriented #programming #semantics
A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming (MW), pp. 45–46.
SACSAC-2001-BoscLP
A function-based join for the manipulation of possibilistic relations (PB, LL, OP), pp. 472–476.
SIGMODSIGMOD-2000-FaloutsosSTT #using
Spatial Join Selectivity Using Power Laws (CF, BS, AJMT, CTJ), pp. 177–188.
SIGMODSIGMOD-2000-MoonSL #adaptation #distance #multi
Adaptive Multi-Stage Distance Join Processing (HS, BM, SL), pp. 343–354.
SIGMODSIGMOD-2000-SalemBCL #how #incremental #maintenance
How To Roll a Join: Asynchronous Incremental View Maintenance (KS, KSB, RC, BGL), pp. 129–140.
VLDBVLDB-2000-ManegoldBK #cpu #memory management #optimisation #what
What Happens During a Join? Dissecting CPU and Memory Optimization Effects (SM, PAB, MLK), pp. 339–350.
VLDBVLDB-2000-RamasamyPNK #set
Set Containment Joins: The Good, The Bad and The Ugly (KR, JMP, JFN, RK), pp. 351–362.
WLCWLC-2000-Auinger #pseudo
Join Decompositions of Pseudovarieties of the Form DH ECom (KA), pp. 40–50.
CIKMCIKM-2000-BohmBBK #clustering #performance #similarity
High Performance Clustering Based on the Similarity Join (CB, BB, MMB, HPK), pp. 298–305.
CIKMCIKM-2000-LiFK #retrieval
Structural Join Index Driven Complex Object Retrieval: Mechanisms and Selection (QL, CWF, KK), pp. 150–157.
ICPRICPR-v1-2000-WolfSW #3d #set
Join Tensors: On 3D-to-3D Alignment of Dynamic Sets (LW, AS, YW), pp. 1388–1391.
SACSAC-2000-HaratyF #distributed #optimisation #query #using
Distributed Query Optimization Using PERF Joins (RAH, RCF), pp. 284–288.
PODSPODS-1999-AlonGMS #self
Tracking Join and Self-Join Sizes in Limited Storage (NA, PBG, YM, MS), pp. 10–20.
PODSPODS-1999-PapadiasMT #multi #optimisation #using
Processing and Optimization of Multiway Spatial Joins Using R-Trees (DP, NM, YT), pp. 44–55.
SIGMODSIGMOD-1999-AcharyaGPR99a #approximate #query
Join Synopses for Approximate Query Answering (SA, PBG, VP, SR), pp. 275–286.
SIGMODSIGMOD-1999-ChaudhuriMN #on the #random
On Random Sampling over Joins (SC, RM, VRN), pp. 263–274.
SIGMODSIGMOD-1999-HaasH #online
Ripple Joins for Online Aggregation (PJH, JMH), pp. 287–298.
SIGMODSIGMOD-1999-MamoulisP #algorithm #integration #multi
Integration of Spatial Join Algorithms for Processing Multiple Inputs (NM, DP), pp. 1–12.
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.
CIKMCIKM-1999-LimKO #scheduling
Page Access Scheduling in Join Processing (AL, JLPK, WCO), pp. 276–283.
CIKMCIKM-1999-SongWLLK
Transformation-Based Spatial Join (JWS, KYW, YKL, MJL, SWK), pp. 15–26.
TOOLSTOOLS-PACIFIC-1999-Taniar #object-oriented #optimisation #query #traversal
Optimizing Object-Oriented Collection Join Queries through Path Traversals (DT), pp. 295–304.
SIGMODSIGMOD-1998-HjaltasonS #algorithm #database #distance #incremental
Incremental Distance Join Algorithms for Spatial Databases (GRH, HS), pp. 237–248.
VLDBVLDB-1998-ArgePRSV #scalability
Scalable Sweeping-Based Spatial Join (LA, OP, SR, TS, JSV), pp. 570–581.
VLDBVLDB-1998-BraumandlCK #database #functional #object-oriented #set
Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases (RB, JC, AK), pp. 110–122.
VLDBVLDB-1998-GraefeBC #sql
Hash Joins and Hash Teams in Microsoft SQL Server (GG, RB, SC), pp. 86–97.
VLDBVLDB-1998-HelmerWM #algorithm #named
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships (SH, TW, GM), pp. 98–109.
VLDBVLDB-1998-ZimbraoS #approximate
A Raster Approximation For Processing of Spatial Joins (GZ, JMdS), pp. 558–569.
CIKMCIKM-1998-SaracEA #estimation
Iterated DFT Based Techniques for Join Size Estimation (KS, ÖE, AEA), pp. 348–355.
KDDKDD-1998-CohenH #classification #using
Joins that Generalize: Text Classification Using WHIRL (WWC, HH), pp. 169–173.
SIGMODSIGMOD-1997-KoudasS
Size Separation Spatial Join (NK, KCS), pp. 324–335.
VLDBVLDB-1997-HelmerM #algorithm #comparison #evaluation #in memory #memory management #set
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates (SH, GM), pp. 386–395.
VLDBVLDB-1997-HuangJR #optimisation #traversal #using
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations (YWH, NJ, EAR), pp. 396–405.
VLDBVLDB-1997-PellenkoftLK #complexity
The Complexity of Transformation-Based Join Enumeration (AP, CAGL, MLK), pp. 306–315.
VLDBVLDB-1997-ShaferA #algorithm #data mining #mining #parallel #similarity
Parallel Algorithms for High-dimensional Similarity Joins for Data Mining Applications (JCS, RA), pp. 176–185.
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-GangulyGMS #estimation
Bifocal Sampling for Skew-Resistant Join Size Estimation (SG, PBG, YM, AS), pp. 271–281.
SIGMODSIGMOD-1996-LoR
Spatial Hash-Joins (MLL, CVR), pp. 247–258.
SIGMODSIGMOD-1996-PatelD
Partition Based Spatial-Merge Join (JMP, DJD), pp. 259–270.
SIGMODSIGMOD-1996-VanceM #agile #optimisation
Rapid Bushy Join-order Optimization with Cartesian Products (BV, DM), pp. 35–46.
VLDBVLDB-1996-PoosalaI #estimation
Estimation of Query-Result Distribution and its Application in Parallel-Join Load Balancing (VP, YEI), pp. 448–459.
POPLPOPL-1996-FournetG #calculus #reflexive
The Reflexive CHAM and the Join-Calculus (CF, GG), pp. 372–385.
HPDCHPDC-1996-AlmerothA #behaviour #modelling #multi
Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone (KCA, MHA), pp. 209–216.
SIGMODSIGMOD-1995-BhargavaGI #query
Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates (GB, PG, BRI), pp. 304–315.
SIGMODSIGMOD-1995-ChaudhuriDY #execution #optimisation #query
Join Queries with External Text Sources: Execution and Optimization Techniques (SC, UD, TWY), pp. 410–422.
SIGMODSIGMOD-1995-WilschutFA #evaluation #parallel #query
Parallel Evaluation of Multi-Join Queries (ANW, JF, PMGA), pp. 115–126.
VLDBVLDB-1995-HoelS #benchmark #metric
Benchmarking Spatial Join Operations with Spatial Output (EGH, HS), pp. 606–618.
VLDBVLDB-1995-SteinbrunnPMK #query
Bypassing Joins in Disjunctive Queries (MS, KP, GM, AK), pp. 228–238.
CIKMCIKM-1995-LiR
PERF Join: An Alternative to Two-way Semijoin and Bloomjoin (ZL, KAR), pp. 137–144.
CIKMCIKM-1995-ShrufiT #knowledge base #query #using
Query Processing for Knowledge Bases Using Join Indices (AS, TT), pp. 158–166.
PODSPODS-1994-HaasNS #estimation #on the
On the Relative Cost of Sampling for Join Selectivity Estimation (PJH, JFN, ANS), pp. 14–24.
SIGMODSIGMOD-1994-BrinkhoffKSS #multi
Multi-Step Processing of Spatial Joins (TB, HPK, RS, BS), pp. 197–208.
SIGMODSIGMOD-1994-HsiaoCY #execution #on the #parallel #pipes and filters
On Parallel Execution of Multiple Pipelined Hash Joins (HIH, MSC, PSY), pp. 185–196.
SIGMODSIGMOD-1994-LoR #using
Spatial Joins Using Seeded Trees (MLL, CVR), pp. 209–220.
VLDBVLDB-1994-DavisonG
Memory-Contention Responsive Hash Joins (DLD, GG), pp. 379–390.
VLDBVLDB-1994-Galindo-LegariaPK #performance #question #random #why
Fast, Randomized Join-Order Selection — Why Use Transformations? (CAGL, AP, MLK), pp. 85–95.
VLDBVLDB-1994-LuOT #on the
On Spatially Partitioned Temporal Join (HL, BCO, KLT), pp. 546–557.
VLDBVLDB-1994-SteenhagenABB #query
From Nested-Loop to Join Queries in OODB (HJS, PMGA, HMB, RAdB), pp. 618–629.
VLDBVLDB-1994-XieH #database #object-oriented #performance
Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases (ZX, JH), pp. 522–533.
CIKMCIKM-1994-MarekR
TID Hash Joins (RM, ER), pp. 42–49.
PODSPODS-1993-Gelder #estimation #multi
Multiple Join Size Estimation by Virtual Domains (AVG), pp. 180–189.
PODSPODS-1993-HaasNSS #estimation
Fixed-Precision Estimation of Join Selectivity (PJH, JFN, SS, ANS), pp. 190–201.
SIGMODSIGMOD-1993-BrinkhoffKS #performance #using
Efficient Processing of Spatial Joins Using R-Trees (TB, HPK, BS), pp. 237–246.
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.
SIGMODSIGMOD-1993-ShatdalN #memory management #parallel #using
Using Shared Virtual Memory for Parallel Join Processing (AS, JFN), pp. 119–128.
SIGMODSIGMOD-1993-SuLRD #estimation
An Instant and Accurate Estimation Method for Joins and Selection in a Retrieval-Intensive Environment (WS, YL, NR, YD), pp. 79–88.
VLDBVLDB-1993-ShekitaYT #multi #optimisation #symmetry
Multi-Join Optimization for Symmetric Multiprocessors (EJS, HCY, KLT), pp. 479–492.
CIKMCIKM-1993-SegevZ #maintenance #performance
Efficient Maintenance of Rule-Derived Data through Join Pattern Indexing (AS, JLZ), pp. 194–205.
SACSAC-1993-ChungY #algorithm #multi
Distributive Join Algorithm for Shared-Memory Multiprocessors (SMC, JY), pp. 546–553.
PODSPODS-1992-Morishita #multi #source code
Avoiding Cartesian Products in Programs for Multiple Joins (SM), pp. 368–379.
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.
VLDBVLDB-1992-DeWittNSS #parallel
Practical Skew Handling in Parallel Joins (DJD, JFN, DAS, SS), pp. 27–40.
VLDBVLDB-1992-Muralikrishna #algorithm #query #sql
Improved Unnesting Algorithms for Join Aggregate SQL Queries (MM), pp. 91–102.
SIGMODSIGMOD-1991-IoannidisC #fault #on the
On the Propagation of Errors in the Size of Join Results (YEI, SC), pp. 268–277.
PODSPODS-1990-Tay #multi #on the
On the Optimality of Strategies for Multiple Joins (YCT), pp. 124–131.
SIGMODSIGMOD-1990-IoannidisK #algorithm #optimisation #query #random #scalability
Randomized Algorithms for Optimizing Large Join Queries (YEI, YCK), pp. 312–321.
SIGMODSIGMOD-1990-ShekitaC #evaluation #performance #pointer
A Performance Evaluation of Pointer-Based Joins (EJS, MJC), pp. 300–311.
VLDBVLDB-1990-CareySLLM #incremental
An Incremental Join Attachment for Starburst (MJC, EJS, GL, BGL, JM), pp. 662–673.
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-OnoL #complexity #optimisation #query
Measuring the Complexity of Join Enumeration in Query Optimization (KO, GML), pp. 314–325.
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-ZellerG #adaptation #algorithm #multi
An Adaptive Hash Join Algorithm for Multiuser Environments (HZ, JG), pp. 186–197.
PLDIPLDI-1990-Sarkar #order #parallel
Instruction Reordering for Fork-Join Parallelism (VS), pp. 322–336.
ICLPNACLP-1990-KaleR #parallel
Joining AND Parallel Solutions in AND/OR Parallel Systems (LVK, BR), pp. 624–641.
SIGMODSIGMOD-1989-CammarataRS #database #relational
Extendeing a Relational Database with Deferred Referential Integrity Checking and Intelligent Joins (SJC, PR, DS), pp. 88–97.
SIGMODSIGMOD-1989-SchneiderD #algorithm #evaluation #parallel #performance
A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment (DAS, DJD), pp. 110–121.
SIGMODSIGMOD-1989-Swami #combinator #heuristic #optimisation #query #scalability
Optimization of Large Join Queries: Combining Heuristic and Combinatorial Techniques (ANS), pp. 367–376.
VLDBVLDB-1989-KitsuregawaNT #hybrid
The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method (MK, MN, MT), pp. 257–266.
VLDBVLDB-1989-MurphyR #effectiveness #execution #multi #resource management
Effective Resource Utilization for Multiprocessor Join Execution (MCM, DR), pp. 67–75.
VLDBVLDB-1989-SegevG #database #optimisation #relational
Event-Join Optimization in Temporal Relational Databases (AS, HG), pp. 205–215.
SIGMODSIGMOD-1988-LeuchnerMS #algorithm #dependence #functional #polynomial #testing
A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies (JHL, LM, GS), pp. 218–224.
SIGMODSIGMOD-1988-SwamiG #optimisation #query #scalability
Optimization of Large Join Queries (ANS, AG), pp. 8–17.
VLDBVLDB-1988-NakayamaK #using
Hash-Partitioned Join Method Using Dynamic Destaging Strategy (MN, MK, MT), pp. 468–478.
SIGMODSIGMOD-1987-RichardsonLM #algorithm #design #evaluation #parallel #pipes and filters
Design and Evaluation of Parallel Pipelined Join Algorithms (JPR, HL, KPM), pp. 399–409.
VLDBVLDB-1986-CheineyFMT #clustering #multi #reliability #using
A Reliable Backend Using Multiattribute Clustering and Select-Join Operator (JPC, PF, RM, JMT), pp. 220–227.
PODSPODS-1985-Gyssens #dependence #embedded
Embedded Join Dependencies as a Tool for Decomposing Full Join Dependencies (MG), pp. 205–214.
PODSPODS-1985-Keller #algorithm #database
Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins (AMK), pp. 154–163.
VLDBVLDB-1985-DeWittG #algorithm #multi
Multiprocessor Hash-Based Join Algorithms (DJD, RHG), pp. 151–164.
VLDBVLDB-1985-LuC #algorithm #distributed #network
Some Experimental Results on Distributed Join Algorithms in a Local Network (HL, MJC), pp. 292–304.
PODSPODS-1984-GyssensP #composition #dependence #on the
On the Decomposition of Join Dependencies (MG, JP), pp. 143–152.
SIGMODSIGMOD-1984-Chan
Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions (EPFC), pp. 149–163.
VLDBVLDB-1984-Tan #constraints #dependence
A Less Costly Constraints Checking for Join Dependency (KPT), pp. 63–68.
VLDBVLDB-1984-YoshikawaK #difference #query
Processing Inequality Queries Based on Generalized Semi-Joins (MY, YK), pp. 416–428.
SIGMODSIGMOD-1983-Christodoulakis
Estimating Block Transfers and Join Sizes (SC), pp. 40–54.
SIGMODSIGMOD-1982-KambayashiYY #database #distributed #query #using
Query Processing for Distributed Databases Using Generalized Semi-Joins (YK, MY, SY), pp. 151–160.
SIGMODSIGMOD-1982-Valduriez #algorithm #multi
Semi-Join Algorithms for Multiprocessor Systems (PV), pp. 225–233.
VLDBVLDB-1981-Chase #database #graph
Join Graphs and Acyclic Database Schemes (KC), pp. 95–100.
VLDBVLDB-1981-MenonH #analysis #design #relational
Design and Analysis of a Relational Join Operation for VLSI (JM, DKH), pp. 44–55.
VLDBVLDB-1981-MerrettKY #scheduling
Scheduling of Page-Fetches in Join Operations (THM, YK, HY), pp. 488–498.
SIGMODSIGMOD-1980-ChiuH #query
A Methodology for Interpreting Tree Queries Into Optimal Semi-Join Expressions (DMC, YCH), pp. 169–178.
SIGMODSIGMOD-1980-Kim
A New Way to Compute the Product and Join of Relations (WK), pp. 179–187.
VLDBVLDB-1980-Honeyman
Extension Joins (PH), pp. 239–244.
VLDBVLDB-1979-Kent
The Entity Join (WK), pp. 232–238.
SIGMODSIGMOD-1975-Gotlieb
Computing Joins of Relations (LRG), pp. 55–63.

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.