I would like to store an input of tab separated values where say C1, C2, C3 and C4 represent the columns of the data and there are N rows of data. If so, I could do lookups in the hash to see if some given values for C1,C2,C3,C4 exist. Someone suggested to me that, in the worst case, the space complexity of this was N4. I would like help formulating a clear explanation as to why that is not true.
space complexity of multi-dimensional hash
377 Views Asked by harschware At
1
There are 1 best solutions below
Related Questions in HASH
- How can py tuple implicit cast to int?
- How to properly set hashes in script-src CSP policy header?
- Algorithm for finding the largest common substring for n strings using Rabin-Karp function
- Lua: is there a need to use hash of string as a key in lua tables
- When the key values are the same, the memory limit is exceeded when making a hash join
- Short for creating an array of hashes in powershell malfunction?
- LC347: Top K Frequent Elements; final result returns an extra element in list/array
- Hashing vertices of a Graph in C
- Is there a limit on the message size for SHA3?
- When hashing an API key, should I hash the suffix / prefix as well?
- Cmake error : Configuring incomplete, errors occurred
- murmur3 hashing function in postgres
- Hashing the password if it is not hashed in django
- Order of a set in Python
- Comparing the hash of a file, containing a list of hashes of multiple files instead of each file, is it good?
Related Questions in HASHTABLE
- Hashing vertices of a Graph in C
- The difference between set definitions in Python
- Order of a set in Python
- Why is fast lookup possible for dict.items()?
- Radix tree vs Hashtable
- Hashtable lookup time confusing if hash function is not constant
- Hash Table creation runtime complexity
- Powershell script no longer working, error "The assignment expression is not valid. "
- Why python3 dict's get method O(1) time while under the hood it is aclually O(n)?
- How to benchmark/compare Hlist and rbtree?
- Powershell I can not figure out how to process several hash-tables to desired output with help of inlayed foreach cycles
- Is there a way to call libcuckoo's cuckoo_hash_map with keys only (C++)?
- Problem with not existing element in Hash Table in C
- Memory leak in C: free a hashtable
- My program just stopped printing in the outputFile after I add some changes
Related Questions in BIG-O
- Why is the runtime for this O(n)?
- What is the average and worst-case time complexity of my string searching algorithm?
- Complexity in Union of disjointed sets with lists
- Usage of merge in linux sort utility
- How to find big o of dependent loops and recursive functions?
- calculating number of operations in algorithm
- How to differentiate between O(n^2) and O(2^n) in dynamic programming with 2 parameters with memoization?
- Having confusion with calculating Big O complexity
- Write code to match a specific Big-O-Notation
- Error vs time complexity in big-O notation
- Time complexity of simultaneous iteration
- Time complexity for recursive binary search that also prints current subarray
- What's the Time Complexity of two separate inner loops nested in an outer loop?
- String manipulation & algorithmic complexity
- Big O notation of string permutation in Python
Related Questions in MULTIDIMENSIONAL-ARRAY
- How could you print a specific String from an array with the values of an array from a double array on the same line, using iteration to print all?
- How to populate two dimensional array
- Dynamic Nested Multi-Dimensional Arrays in Rust
- Numpy array methods are faster than numpy functions?
- Multioutput regression using GPU
- Unexpected result when assigning and printing pointer value of two-dimensional array with its name
- Getting distances of points in 2D space in an array in Fortran using the concept of broadcasting (Python)
- Using Closing Stock Balance as Opening Stock in subsequent line item
- Data structure for a console menu in Node.js with nested options that can be navigated backwards
- Consolidate column values within each subset of a multidimensional array as comma separated values
- Short for creating an array of hashes in powershell malfunction?
- How can i find every instance of a repeating string in a list, and then concatenate it to the list element that precedes it in every instance?
- Hierarchically group 2d array data by two columns and concatenate third column values in each unique path
- Sum multiple items in 2D array based on condition (javascript)
- Matrix Multiplication in using 2D arrays
Related Questions in SPACE-COMPLEXITY
- How Fast Does MongoDB Indices Grow in Size?
- Time Complexity of "in" keyword in python when using a list? Leetcode
- lru_cache vs dynamic programming, stackoverflow with one but not with the other?
- Space Complexity of a Recursion Function Involving Additional Self-Contained Auxiliary Space
- Reducing Memory on Binary Search Tree Insertion
- Subtree of Another Tree Complexity Analysis
- Complexity of np.argsort()
- Complexity of std::inplace_merge
- How to find time and space complexity for this js code?
- Space Complexity of flattening 2d array
- How can i improve time complexity of my python code?
- The theoretical complexity of Tries and the distances of Levenshtein to suggest similar words
- Does overwriting an existing array with a new array cost extra time or memory in the context of complexity analysis?
- Auxiliary Space Complexity of Dictionaries whose Keys are Iterables of Variable Size
- Time and Auxiliary Space Complexities of .values(), .items(), .keys()
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The other person is thinking that if you try to store an N by N grid of points, there will be N4 points to store.
But if you have N points, then you're just storing a hash. And a hash with N data points typically takes O(N) space. (Technically it takes the size of the hash table plus the space for the data, but people usually dynamically size the hash table to be the same order of magnitude size as the data set.)