Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Efficient search through a huge dataset

by artist (Parson)
on Oct 19, 2004 at 23:57 UTC ( [id://400709]=note: print w/replies, xml ) Need Help??


in reply to Efficient search through a huge dataset

I don't have solution at this point, but we will be sure if this is exactly what you desire.

  • A:Are you trying to find out whether your second file is a subset of first file?
  • Or B: Find (also) the records in the second file which are not in the first file?

    • Comment on Re: Efficient search through a huge dataset

    • Replies are listed 'Best First'.
    Re^2: Efficient search through a huge dataset
    by johnnywang (Priest) on Oct 20, 2004 at 01:00 UTC
      B. Actually for each record in the second file, I'd like to mark it 1/0 depending on whether it's in the first.
    		[reply]

    In Section Seekers of Perl Wisdom

    Log In?
    Username:
    Password:

    What's my password?
    Create A New User
    Domain Nodelet?

    www.com | www.net | www.org
    Node Status?
    node history
    Node Type: note [id://400709]
    help
    Chatterbox?
    and the web crawler heard nothing...

    How do I use this? • Last hour • Other CB clients
    Other Users?
    Others romping around the Monastery: (4)
    As of 2024-04-19 03:54 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      No recent polls found