Data Structures Cheat Sheet
This article delves into data structures, highlighting graphs' role in real-world applications. It explains creating nodes and relationships in Memgraph efficiently. Various structures like Linked Lists, Queues, Stacks, and Trees are covered, along with traversal algorithms like BFS and DFS in Memgraph for efficient graph exploration. Readers are encouraged to explore further in Memgraph's documentation and community.
Read original article
This article introduces data structures, focusing on graphs as non-linear structures used in various real-world applications like networks and fraud detection. It explains how to create nodes and relationships in Memgraph, a tool for representing data structures efficiently. The piece covers other data structures like Linked Lists, Queues, Stacks, and Trees, detailing their representations in Memgraph and operations like adding and removing elements. It also discusses tree traversal algorithms like Breadth First Search (BFS) and Depth First Search (DFS), showing how to implement them in Memgraph for efficient graph traversal. The article concludes by inviting readers to explore more about data structures and their applications in Memgraph through their documentation and community channels.
Related
Compressing graphs and indexes with recursive graph bisection (2016)
Graph reordering is applied to boost compression in graphs and indexes. A new compression-friendly technique using recursive graph bisection shows improved rates for large-scale graphs, enhancing storage and processing efficiency.
GraphRAG (from Microsoft) is now open-source!
GraphRAG, a GitHub tool, enhances question-answering over private datasets with structured retrieval and response generation. It outperforms naive RAG methods, offering semantic analysis and diverse, comprehensive data summaries efficiently.
Building a data compression utility in Haskell using Huffman codes
Building a data compression utility in Haskell with Huffman codes. Explains Huffman codes, prefix-free codes, creating codes with binary trees, encoding/decoding text, laziness, encoding binary data, and serializing compressed output.
How to implement a hash table in C (2021)
This article explains implementing a hash table in C, covering linear/binary search, hash table design, simple hash function, collision handling, resizing, and API design. Code snippets and GitHub repository link provided.
From Trees to Tables: Storing Hierarchical Data in Relational Databases
Storing hierarchical data in relational databases involves techniques like Adjacency List, Nested Sets, and Materialized Path models. Each method has trade-offs in efficiency, complexity, and storage based on factors like data size and usage patterns. The choice depends on specific needs for performance, storage, and flexibility.
2 commentsNot a cheat sheet.
More and more the title "cheat sheet" is used to attract clicks for articles that are nothing of the sort.
Aren't they the same thing? Are there implicit differences the author is leaving unsaid?
Related
Compressing graphs and indexes with recursive graph bisection (2016)
Graph reordering is applied to boost compression in graphs and indexes. A new compression-friendly technique using recursive graph bisection shows improved rates for large-scale graphs, enhancing storage and processing efficiency.
GraphRAG (from Microsoft) is now open-source!
GraphRAG, a GitHub tool, enhances question-answering over private datasets with structured retrieval and response generation. It outperforms naive RAG methods, offering semantic analysis and diverse, comprehensive data summaries efficiently.
Building a data compression utility in Haskell using Huffman codes
Building a data compression utility in Haskell with Huffman codes. Explains Huffman codes, prefix-free codes, creating codes with binary trees, encoding/decoding text, laziness, encoding binary data, and serializing compressed output.
How to implement a hash table in C (2021)
This article explains implementing a hash table in C, covering linear/binary search, hash table design, simple hash function, collision handling, resizing, and API design. Code snippets and GitHub repository link provided.
From Trees to Tables: Storing Hierarchical Data in Relational Databases
Storing hierarchical data in relational databases involves techniques like Adjacency List, Nested Sets, and Materialized Path models. Each method has trade-offs in efficiency, complexity, and storage based on factors like data size and usage patterns. The choice depends on specific needs for performance, storage, and flexibility.