HITS algorithm
A link analysis algorithm that scores nodesA vertex in a graph. In a property graph it can carry labels and properties. two ways at once — as an authority, endorsed by the nodes pointing at it, and as a hub, endorsing the nodes it points to.
Also written: HITS, Hyperlink-Induced Topic Search
Lessons that use this term
The lesson and course links below open in a new tab.
32 lessons use this term. Results are ordered by term density.
Cypher Indexes and Constraints23 mentions
- Creating a Composite Index on a Node PropertyUsing Indexes in Neo4jthis query and note the number of total db hits2 mentions
- Creating a RANGE Index on a Relationship PropertyUsing Indexes in Neo4jnote the number of total db hits and elapsed3 mentions
- Creating a RANGE Index on a Node PropertyUsing Indexes in Neo4jnote the number of total db hits2 mentions
- Using query hintsIndex Usage in Neo4jthe elapsed time using either query is about the same, but there are fewer db hits with the use of the TEXT index on the relationship1 mention
- Using a TEXT indexUsing Indexes in Neo4jthis query to get the true elapsed time and total db hits2 mentions
- Creating TEXT IndexesUsing Indexes in Neo4jthe elapsed ms times are the same for two queries so we use the lower total db hits as a way of choosing which query is4 mentions
- Creating Single Property IndexesUsing Indexes in Neo4jplan produced by the PROFILE, you will see that it required 27,376 total db hits3 mentions
- Creating Multi-property IndexesUsing Indexes in Neo4jexecute this query on the graph, you will see that it requires 27,927 total db hits to complete the2 mentions
- Controlling Index UsageIndex Usage in Neo4jthe same elapsed time, but requires more db hits2 mentions
- Creating and Using Full-text IndexesUsing Full-text Indexes in Neo4jdb hits statistics do not reflect the true db hits because the PROFILE will never expose details of a2 mentions
Cypher Aggregations3 mentions
- Using Pattern ComprehensionUnderstanding Aggregation in Cyphersee some differences in the PROFILE results for db hits and elapsed time in Neo4j2 mentions
- Creating ListsUnderstanding Aggregation in Cyphersee some differences in the PROFILE results for db hits and elapsed time in Neo4j1 mention
AI on Your Lakehouse: Context Comes in Shapes, Not Queries5 mentions
- Navigate the ShapeNavigate What's There - Table of Contentshits span all three folders - bulletins, manuals, and recalls: the misfire bulletins (tsb-20-501, tsb-22-301), the2 mentions
- The Estate QuestionsPut It Together - the finaletree shape enumerates: it walks every document and reports the codes with zero hits2 mentions
- Workshop OverviewThe Context Problemis the same wall a legal team hits asking which contracts are missing a required clause, or a quality team asking which procedures were never1 mention
Aura In Production6 mentions
- Optimizing Query PerformanceLogs and Query Optimizationshows the actual number of database hits, rows returned, and time spent in each3 mentions
- Page Cache Performance and EvictionsMonitoring Instance PerformanceCache hits are fast because the data is already in1 mention
- Monitoring Out of Memory ErrorsMonitoring Resourcesfor operators with a high number of database hits or high memory1 mention
- Working with Query LogsLogs and Query Optimizationwith a high number of page hits - This is a sign that the query may be looking at too much of the graph, is not using indexes, and either the query1 mention
Neo4j Administration Workshop3 mentions
- ExploreLogs and Monitoringcompletion entry includes the total execution time, page hits, and the query runtime1 mention
- Log ConfigurationLogs and Monitoringin the log | | db.logs.query.page_logging_enabled | false | Include page hits and faults1 mention
- Log FilesLogs and Monitoringentry includes the query id, transaction id, execution time, page hits, connection details, database, user, and query1 mention
Understand centrality algorithms11 mentions
- EndorsementUnderstand centrality algorithmsCentrality, PageRank, Article Rank and HITs are the four algorithms in this8 mentions
- What is centrality?Understand centrality algorithms| | Endorsement | into the node | Page Rank, Article Rank, Eigenvector, HITS | How important are the nodes that point at this2 mentions
- Explore the graphUnderstand centrality algorithmsPage Rank Article Rank Eigenvector Centrality HITS1 mention
Neo4j Management, Optimization, and Refactoring Workshop2 mentions
- Breaking down complex queries with WITHQuery Performancenumber of database hits is slightly reduced, but the total allocated memory is significantly reduced as the properties of only the top 101 mention
- Analyzing Query PerformanceQuery Performancequery plan includes pagecache statistics and absolute database hits1 mention
Aura Graph Analytics fundamentals2 mentions
- Session and catalog managementAura Graph Analytics in the Aura WorkspaceHITS [Topological2 mentions
Graph Data Modeling Fundamentals2 mentions
- Labels in the GraphRefactoring the Graphshows a query plan by the number of db hits for the query to retrieve all Person2 mentions
Intermediate Cypher Queries2 mentions
- Query Patterns and PerformanceFiltering Queriesmetric that is typically a good measure of query performance is the number db hits1 mention
- Graph TraversalGraph Traversalthis second query, you see that there are fewer db hits1 mention
Graph Data Science in Practice1 mention
- Building Fraud CommunitiesCommunity Detection for Fraudsame person controls both accounts Money is being moved before a chargeback hits1 mention