En cours

Method for getting list of hard links in NTFS

Hi,

NFTS file systems allow the creation of hard links for files. For example, the WinSxS has many files that have hard links. This means that files in other folders are in reality stored in the WinSxS directory, etc.

For one of our projects, we are currently looking for a quick way to get a list of hard links with a table [origin => destination]. So far we found a way to get this list by iterating over all files of the drive recursively. However, this takes very very long because we have to open each single file on a drive.

We think that this information is probably also somewhere in the MFT or in another location of the file system so – in theory – there must be a way to get the links faster.

We need someone who can create a faster method for us: We need a method to receive the list of all hard lists of a drive within a few seconds of CPU time (i.e. without looping over each directory).

* * * Please only bid if you know how to do that! * * *

We need to access your method from C# but a C++ interface would be OK as well.

Best greetings,

Sven

Compétences : Programmation C#, Programmation C++

Voir plus : list hard links, ntfs list, list hard links ntfs, list ntfs hard links, list ntfs, hard links, think recursively, recursively, programming theory, programming method, programming in access, method programming, is programming hard, in system programming, how to think recursively, how hard is programming, hard links ntfs list, origin , method, list of , bid list, create file table access, file list ntfs mft, mft file, best cpu

Concernant l'employeur :
( 97 commentaires ) Delmenhorst, Germany

N° du projet : #1059492

Décerné à :

jasminjx

Hello. I have a good knowledge about NTFS file system. It's possible. If you choose me, i will do it quickly and smartly. Regards.

150 $ USD en 3 jours
(7 Commentaires)
3.9

2 freelance ont fait une offre moyenne de 190 $ pour ce travail

coder789

please check PM. i can do this

230 $ USD en 5 jours
(0 Commentaires)
0.0