Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8151925
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 6, 20262026-06-06T15:33:17+00:00 2026-06-06T15:33:17+00:00

I am looking for an efficient (both computer resource wise and learning/implementation wise) method

  • 0

I am looking for an efficient (both computer resource wise and learning/implementation wise) method to merge two larger (size>1 million / 300 KB RData file) data frames.

“merge” in base R and “join” in plyr appear to use up all my memory effectively crashing my system.

Example
load test data frame

and try

test.merged<-merge(test, test)

or

test.merged<-join(test, test, type="all")  
    –

The following post provides a list of merge and alternatives:
How to join (merge) data frames (inner, outer, left, right)?

The following allows object size inspection:
https://heuristically.wordpress.com/2010/01/04/r-memory-usage-statistics-variable/

Data produced by anonym

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-06T15:33:19+00:00Added an answer on June 6, 2026 at 3:33 pm

    Here’s the obligatory data.table example:

    library(data.table)
    
    ## Fix up your example data.frame so that the columns aren't all factors
    ## (not necessary, but shows that data.table can now use numeric columns as keys)
    cols <- c(1:5, 7:10)
    test[cols] <- lapply(cols, FUN=function(X) as.numeric(as.character(test[[X]])))
    test[11] <- as.logical(test[[11]])
    
    ## Create two data.tables with which to demonstrate a data.table merge
    dt <- data.table(test, key=names(test))
    dt2 <- copy(dt)
    ## Add to each one a unique non-keyed column
    dt$X <- seq_len(nrow(dt))
    dt2$Y <- rev(seq_len(nrow(dt)))
    
    ## Merge them based on the keyed columns (in both cases, all but the last) to ...
    ## (1) create a new data.table
    dt3 <- dt[dt2]
    ## (2) or (poss. minimizing memory usage), just add column Y from dt2 to dt
    dt[dt2,Y:=Y]
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm looking to try to make an efficient delete method to work on a
Am looking for some (efficient) code to determine the size of a directory /
I am looking for a method to find if two strings are anagrams of
I am looking for performance efficient ways to compare two byte[] for equality. Sizes
I'm looking for an algorithm which can take two sets of integers (both positive
I'm looking for an efficient way to hash a 6-byte field so that it
I'm looking for an efficient algorithm for scrambling a set of letters into a
I am looking for an efficient indexed persistent data structure. I typically work in
I am looking for an efficient eigensolver ( language not important, although I would
I'm looking for an efficient way to get the list of unique commit authors

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.