-
Notifications
You must be signed in to change notification settings - Fork 130
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
7856c0f
commit 43900c6
Showing
6 changed files
with
244 additions
and
75 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
import React, { useState } from 'react'; | ||
import styles from './styles.module.scss'; | ||
import { LinkButton } from '/src/theme/Buttons'; | ||
import Link from '@docusaurus/Link'; | ||
import Card from './card'; | ||
import knowledge from '/data/knowledgecards.json'; | ||
import { ButtonContainer } from '../../theme/Buttons'; | ||
|
||
export default function Highlights() { | ||
const [selectedCard, setSelectedCard] = useState('All'); | ||
|
||
const highlights = knowledge.highlights; | ||
|
||
const handleCardFilter = (card) => { | ||
setSelectedCard(card); | ||
}; | ||
|
||
return ( | ||
<div className={styles.highlights}> | ||
<h3>Highlights</h3> | ||
<div className={styles.knowledgeHighlights}> | ||
<div className={styles.cardResults}> | ||
<div | ||
className={`${ | ||
styles.cardContainer | ||
} ${selectedCard.toLowerCase()}-card`} | ||
> | ||
{highlights.map((card) => { | ||
return <Card key={card.name} details={card} />; | ||
})} | ||
</div> | ||
</div> | ||
</div> | ||
<hr></hr> | ||
</div> | ||
); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,63 +1,91 @@ | ||
[ | ||
{ | ||
"type": "Tutorial", | ||
"title": "Quickstart", | ||
"text": "Vectors are mathematical representations of data objects, which enable similarity-based searches in vector databases like Weaviate...", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Weaviate", "Tutorial"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Vector Index", | ||
"photo": "", | ||
"text": "A vector index is a type of data structure for efficiently storing high-dimensional vector data generated by machine learning models. Its main purpose is facilitating quick and accurate similarity searches, using algorithms like trees or hashing to reduce complexity in high-dimensional spaces...", | ||
"link": "developers/weaviate/concepts/vector-index", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Image", | ||
"title": "Vector Index", | ||
"photo": "knowledge-vector.svg", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Weaviate", "Image"] | ||
}, | ||
{ | ||
"type": "Tutorial", | ||
"title": "Quickstart", | ||
"text": "Vectors are mathematical representations of data objects, which enable similarity-based searches in vector databases like Weaviate...", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Weaviate", "QuickStart"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Graph-Based Index", | ||
"photo": "", | ||
"text": "HNSW is a graph-based indexing technique, meaning that it organizes the data points in a graph structure rather than traditional tree-based or hash-based structures. This graph-based approach is key to its performance in high-dimensional vector space searches.", | ||
"link": "developers/weaviate/concepts/vector-index", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Layered Navigation", | ||
"photo": "", | ||
"text": "During a search, HNSW starts at the topmost layer and makes 'big jumps' across the graph to quickly move closer to the target region. As it moves down the layers, the search becomes more refined, with smaller, more local jumps until the nearest neighbors are identified in the bottom layer.", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Hierarchical Graph Structure", | ||
"photo": "", | ||
"text": "HNSW utilizes a multi-layered graph structure where each layer is a graph of the data points. The top layers contain fewer points with long-range connections, and as you go down the layers, the number of points increases, and the connections become more local. This hierarchical structure allows for efficient navigation during search queries.", | ||
"link": "/developers/weaviate/introduction#how-does-weaviate-work", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Fusion Algorithm", | ||
"photo": "", | ||
"text": "In hybrid search, the fusion algorithm combines results from keyword and vector searches into a final list of ranked search results. A popular fusion algorithm is called reciprocal ranked fusion, which uses the sum of the inverse of the position of the results. There are multiple types of fusion algorithms. Weaviate supports reciprocal rank fusion and relative score fusion.", | ||
"link": "https://weaviate.io/developers/weaviate/api/graphql/additional-properties#score", | ||
"tags": ["JS", "Hybrid Search", "Introduction"] | ||
} | ||
] | ||
{ | ||
"all": [ | ||
{ | ||
"type": "Tutorial", | ||
"title": "Quickstart", | ||
"text": "Vectors are mathematical representations of data objects, which enable similarity-based searches in vector databases like Weaviate...", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Weaviate", "Tutorial"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Vector Index", | ||
"photo": "", | ||
"text": "A vector index is a type of data structure for efficiently storing high-dimensional vector data generated by machine learning models. Its main purpose is facilitating quick and accurate similarity searches, using algorithms like trees or hashing to reduce complexity in high-dimensional spaces...", | ||
"link": "developers/weaviate/concepts/vector-index", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Image", | ||
"title": "Vector Index", | ||
"photo": "knowledge-vector.svg", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Weaviate", "Image"] | ||
}, | ||
{ | ||
"type": "Tutorial", | ||
"title": "Quickstart", | ||
"text": "Vectors are mathematical representations of data objects, which enable similarity-based searches in vector databases like Weaviate...", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Weaviate", "QuickStart"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Graph-Based Index", | ||
"photo": "", | ||
"text": "HNSW is a graph-based indexing technique, meaning that it organizes the data points in a graph structure rather than traditional tree-based or hash-based structures. This graph-based approach is key to its performance in high-dimensional vector space searches.", | ||
"link": "developers/weaviate/concepts/vector-index", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Layered Navigation", | ||
"photo": "", | ||
"text": "During a search, HNSW starts at the topmost layer and makes 'big jumps' across the graph to quickly move closer to the target region. As it moves down the layers, the search becomes more refined, with smaller, more local jumps until the nearest neighbors are identified in the bottom layer.", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Hierarchical Graph Structure", | ||
"photo": "", | ||
"text": "HNSW utilizes a multi-layered graph structure where each layer is a graph of the data points. The top layers contain fewer points with long-range connections, and as you go down the layers, the number of points increases, and the connections become more local. This hierarchical structure allows for efficient navigation during search queries.", | ||
"link": "/developers/weaviate/introduction#how-does-weaviate-work", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Fusion Algorithm", | ||
"photo": "", | ||
"text": "In hybrid search, the fusion algorithm combines results from keyword and vector searches into a final list of ranked search results. A popular fusion algorithm is called reciprocal ranked fusion, which uses the sum of the inverse of the position of the results. There are multiple types of fusion algorithms. Weaviate supports reciprocal rank fusion and relative score fusion.", | ||
"link": "https://weaviate.io/developers/weaviate/api/graphql/additional-properties#score", | ||
"tags": ["JS", "Hybrid Search", "Introduction"] | ||
} | ||
], | ||
"highlights": [ | ||
{ | ||
"type": "Introduction", | ||
"title": "Layered Navigation", | ||
"photo": "", | ||
"text": "During a search, HNSW starts at the topmost layer and makes 'big jumps' across the graph to quickly move closer to the target region. As it moves down the layers, the search becomes more refined, with smaller, more local jumps until the nearest neighbors are identified in the bottom layer.", | ||
"link": "/developers/weaviate/quickstart", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Hierarchical Graph Structure", | ||
"photo": "", | ||
"text": "HNSW utilizes a multi-layered graph structure where each layer is a graph of the data points. The top layers contain fewer points with long-range connections, and as you go down the layers, the number of points increases, and the connections become more local. This hierarchical structure allows for efficient navigation during search queries.", | ||
"link": "/developers/weaviate/introduction#how-does-weaviate-work", | ||
"tags": ["JS", "Vector Databases", "Introduction"] | ||
}, | ||
{ | ||
"type": "Introduction", | ||
"title": "Fusion Algorithm", | ||
"photo": "", | ||
"text": "In hybrid search, the fusion algorithm combines results from keyword and vector searches into a final list of ranked search results. A popular fusion algorithm is called reciprocal ranked fusion, which uses the sum of the inverse of the position of the results. There are multiple types of fusion algorithms. Weaviate supports reciprocal rank fusion and relative score fusion.", | ||
"link": "https://weaviate.io/developers/weaviate/api/graphql/additional-properties#score", | ||
"tags": ["JS", "Hybrid Search", "Introduction"] | ||
} | ||
] | ||
} |