Skip to main content

4 Core Patterns for SEO

By
  1. Relevance
    • Your content is relevant to keywords
    • On-page optimization
    • In the past, could just repeat keywords
      • Today, content keywords should be related
    • Think TOPIC Not keywords
    • Divide web pages by topics not by keywords
    • Many pages same topic—google will get confused
    • Aggregate keywords to topics
    • Identify primary keyword within topic
    • Topic in
      • Url's
      • Title tag
        • title tag
      • Header tags
        • <h1>⁣ – Best description of the web page
        • <h2>⁣ – Synonyms to topic
        • <h3+>⁣ – You don't have to optimize
      • Keyword density copy from results 1 – 5
        • How many times your keyword appear vs your total words in your page
        • Use tool tools.seobook.com/general/keyword-density
      • LSI Latent Semantic indexing
        • Prove you are on that topic if you discuss java interview tips, I guesstimate problem coding works would be in your page
        • Do search on Google on below see related searches could give ideas to similar keywords
        • Use tool http://lsigraph.com
        • Don't just include all synonyms just some
      • Image filenames / Alt tags
        • Are primary keywords
      • Outbound links
        • You do want to help your customers, right?
      • Create multiple pages around the topic if this was your main topic, you must have multiple pages surrounding the topic
        • They should all backlink your main page
  2. Crawlability
    • sitemap, internal links, external links
  3. Engagement
    • Customers don't just come to your website and leave it to other websites
  4. Authority
    • Backlinks from authoritative sites

Comments

Post a Comment

Popular posts from this blog

Functional Programming in Scala for Working Class OOP Java Programmers - Part 1

By
Introduction Have you ever been to a scala conf and told yourself "I have no idea what this guy talks about?" did you look nervously around and see all people smiling saying "yeah that's obvious " only to get you even more nervous? . If so this post is for you, otherwise just skip it, you already know fp in scala ;) This post is optimistic, although I'm going to say functional programming in scala is not easy, our target is to understand it, so bare with me. Let's face the truth functional programmin in scala is difficult if is difficult if you are just another working class programmer coming mainly from java background. If you came from haskell background then hell it's easy. If you come from heavy math background then hell yes it's easy. But if you are a standard working class java backend engineer with previous OOP design background then hell yeah it's difficult. Scala and Design Patterns An interesting point of view on scala, is
14 comments
Read more

Alternatives to Using UUIDs

By
  Alternatives to Using UUIDs UUIDs are valuable for several reasons: Global Uniqueness : UUIDs are designed to be globally unique across systems, ensuring that no two identifiers collide unintentionally. This property is crucial for distributed systems, databases, and scenarios where data needs to be uniquely identified regardless of location or time. Standardization : UUIDs adhere to well-defined formats (such as UUIDv4) and are widely supported by various programming languages and platforms. This consistency simplifies interoperability and data exchange. High Collision Resistance : The probability of generating duplicate UUIDs is extremely low due to the combination of timestamp, random bits, and other factors. This collision resistance is essential for avoiding data corruption. However, there are situations where UUIDs may not be the optimal choice: Length and Readability : UUIDs are lengthy (typically 36 characters in their canonical form) and may not be human-readable. In URLs,
Post a Comment
Read more

Bellman Ford Graph Algorithm

By
The Shortest path algorithms so you go to google maps and you want to find the shortest path from one city to another.  Two algorithms can help you, they both calculate the shortest distance from a source node into all other nodes, one node can handle negative weights with cycles and another cannot, Dijkstra cannot and bellman ford can. One is Dijkstra if you run the Dijkstra algorithm on this map its input would be a single source node and its output would be the path to all other vertices.  However, there is a caveat if Elon mask comes and with some magic creates a black hole loop which makes one of the edges negative weight then the Dijkstra algorithm would fail to give you the answer. This is where bellman Ford algorithm comes into place, it's like the Dijkstra algorithm only it knows to handle well negative weight in edges. Dijkstra has an issue handling negative weights and cycles Bellman's ford algorithm target is to find the shortest path from a single node in a graph t
1 comment
Read more