database browser and finding patterns in database records - open to bidding
€250-750 EUR
Paid on delivery
- Database - (preferred orientDB(!), graph Database) - but we might discuss and see ordinary SQL as enough
=> amount of records (1 - 25 Million) - each about 10 columns/fields (might be extended later on)
- GUI / Frontend needed to access Database data
- i would assume front end would be desktop app based
- but maybe a browser based frontend is also good (especially considering the cloud database aspect below.)
- no editing of data as part of user use case needed.
- use cases:
access data (browse data)
statistics on data
visualization data (graph/network type of visualization - optional)
analysis of data (on whole data set and parts of data sets)
- mostly straight forward data extraction tasks. some are more tricky (
visualization of result of analysis (graph/network type of visualization - optional)
in most cases it is only table and (dir-)tree representation
- the visualization / browsing / etc. should rely on lazy-load from database; as full dataset will not fit into memory / display-model
- Some analysis part is the tricky part. It basically should identify equal and (only) similar(!) data records and data record sub-sets (!) across the whole data set.
- the analysis part would benefit from parallelization. I could imagine putting the whole database in the cloud (e.g. AWS, google, etc.) and only keep the frontend local. - best would be if the backend data base can be configurable either local or in the cloud
- focus is on large amount of data, quick on the fly analysis of data, quick display - beauty is secondary.
Regarding the similarity part.
basically the algorithm shall take two graph-trees and compare them. I should find any similar subtree within. similar subtree means that there can be a difference in the trees. The amount of difference, e.g. different leaves is the distance. Find those subtrees with the smallest distance...
E.g. The subtree similarity-search
problem is that of finding, given a tree Q and a large set of
trees Γ = {T1, . . . , Tn}, the subtrees of trees among Γ that are
most similar to Q. Similarity is defined using some tree distance
function.
Within the application you chose a starting point for a subtree. And the results will show all found similar subtrees in order of distance (from closest to further away.)
Project ID: #15770821
About the project
5 freelancers are bidding on average €396 for this job
I am an IITK graduate and I have 11 years of experience in software development. I have 100% completion rate and I have finished projects with the highest level of customer satisfaction. Relevant Skills and Experience More
Hello, I am full-time freelancer, I have gone through your project description I can do it. I am a Software developer with having a good knowledge and 8 years of experience with Software architecture, Software develop More