{"id":26772723,"url":"https://github.com/aguven6/inmemory-data-processor","last_synced_at":"2025-10-12T10:38:56.369Z","repository":{"id":270081045,"uuid":"909281873","full_name":"aguven6/InMemory-Data-Processor","owner":"aguven6","description":"Convert tabular data to columnar data with index. Aim is to process huge data quicker especially in aggregation operation","archived":false,"fork":false,"pushed_at":"2025-01-20T12:08:26.000Z","size":25,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-29T01:23:33.411Z","etag":null,"topics":["columnar-storage","data","data-structures","parallel-computing","parallel-programming","processing"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/aguven6.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-12-28T08:25:22.000Z","updated_at":"2025-02-01T19:03:31.000Z","dependencies_parsed_at":null,"dependency_job_id":"7340eae5-f354-4a89-8904-c496ab3a7236","html_url":"https://github.com/aguven6/InMemory-Data-Processor","commit_stats":null,"previous_names":["aguven6/inmemory-data-processor"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/aguven6/InMemory-Data-Processor","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aguven6%2FInMemory-Data-Processor","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aguven6%2FInMemory-Data-Processor/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aguven6%2FInMemory-Data-Processor/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aguven6%2FInMemory-Data-Processor/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aguven6","download_url":"https://codeload.github.com/aguven6/InMemory-Data-Processor/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aguven6%2FInMemory-Data-Processor/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279011058,"owners_count":26084865,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-12T02:00:06.719Z","response_time":53,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["columnar-storage","data","data-structures","parallel-computing","parallel-programming","processing"],"created_at":"2025-03-29T01:21:11.800Z","updated_at":"2025-10-12T10:38:56.334Z","avatar_url":"https://github.com/aguven6.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n# In Memory Data Processing\n-----------------------------------------------------------------------------------------------------------------\n\nWelcome here! Purpose of this study is create a columnar data structre from tabular data structures. Program will\nfetch data from a tabular data source and create will vectors for each column with indexes.\n\nLet'a assume we have a csv file that includes following columns: Name,Surname,Age,BirthDate\n\nWe will create 4 vectors for each columns like:\n\nIndex is an autoincremental number\n\nVector1: Index,Name\nVector2: Index,Surname\nVector3: Index,Age\nVector4: Index,Birthdate\n\nTasks\n-----------------------------------------------------------------------------------------------------------------\nFilter Data\n----------------------------------------------------\n\n1- Query By Single Value for a Column               Where Name=\"Ahmet\"\n\n2- Query By Multiple Values for a Column            Where Name=\"Ahmet\" or Name=\"Metin\"\n\n3- Query Multiple Columns with Single Values        Where Name=\"Ahmet\" and Surname=\"Mehmet\"\n\n4- Query Multiple Columns with Multiple Values      Where Name=\"Ahmet\" or Name=\"Metin\" and Age \u003e30 and Age \u003c50\n\n\nAggregation\n----------------------------------------------------\n1- Calculate  Sum,Count,Avg, Max, Min for whole data\n\n2- Calculate  Sum,Count,Avg, Max, Min with Filtering\n\n3- Group By a Key and aggregate values for whole data\n\n4- Group By a Key and aggregate values with Filtering\n\n-----------------------------------------------------------------------------------------------------------------\nWhen we complete this task. We will use GPUs to process data. \nNEXT Step will be GPU usage for computing. We will divide and conquer that This is what Computer Science loves.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faguven6%2Finmemory-data-processor","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faguven6%2Finmemory-data-processor","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faguven6%2Finmemory-data-processor/lists"}