ForumNorway.com

[KBleivik]

Advanced SEO is about understanding SE algorithms, how SE's index sites / pages and about writing SE friendly Web pages and SR friendly URL's

1. The difference between a batch-based search engine and an incrementally-updated search engine.

I have read a very interesting recent interview with Matt Cutts, by Aaron Wall. And one of the questions was:

When you guys roll out new algorithms, filters, and patches some good sites end up getting filtered out with the bad. Do you pre-test most of the algorithms prior to launching them? How do you know how strongly to apply filters? By default do you usually lean on one side or the other and then tweak your way back?

and Matt's answer was:

We always put algorithmic changes into our test harnesses to poke and prod in lots of different ways. But you also have to be adaptive. If someone in the outside world notices an issue after a launch that you didn't notice, it's important to take that feedback and act on it, and also to try to improve the testing procedure to cover that in the future. We usually have a pretty strong sense of whether something will be a large-impact launch or not. But you can't completely avoid having a large impact with a launch. An example might be if you're replacing a large subsystem in the crawl-index-serve pipeline. We continually go back and improve or replace sections of our system. Sometimes the results can't be bit-for-bit compatible in output, so you have to do the best you can. Update Fritz in 2003 is the canonical example of that; you can't go from a batch-based search engine to an incrementally-updated search engine without some visible impact. To answer your last question, I personally lean toward softer launches; webmasters never need any extra stress. But sometimes launches can't be made completely soft or invisible, as I mentioned.

2. Stop 302 Redirect Hijacking http://www.loriswebs.com/hijacking_web_pages.html

3. How to stop bad bots and robots.txt http://www.garykeith.com/browsers/downloads.asp

4. Mode-Rewrite Basics http://www.macwoms.com/, http://www.modrewrite.com/ and ISAPI rewrite http://www.isapirewrite.com/

5. 301 Redirects http://www.heatherswebdesign.com/zw12.htm

6. Use the .htaccess file to block referrer spam. http://www.aaronlogan.com/downloads/htaccess.php

"How search engines work
Creating and maintaining an inverted index is the central problem when building an efficient keyword search engine. To index a document, you must first scan it to produce a list of postings. Postings describe occurrences of a word in a document; they generally include the word, a document ID, and possibly the location(s) or frequency of the word within the document.

If you think of the postings as tuples of the form <word, document-id>, a set of documents will yield a list of postings sorted by document ID. But in order to efficiently find documents that contain specific words, you should instead sort the postings by word (or by both word and document, which will make multiword searches faster). In this sense, building a search index is basically a sorting problem. The search index is a list of postings sorted by word."

and

"Incremental versus batch indexing: Some search engines only support batch indexing; once they create an index for a set of documents, adding new documents becomes difficult without re indexing all the documents. Incremental indexing allows easy adding of documents to an existing index. For some applications, like those that handle live data feeds, incremental indexing is critical."

http://www.javaworld.com/javaworld/jw-09-2000/jw-0915-lucene.html

Related Link:
http://www.sitepoint.com/article/search-engine-friendly-urls
_________________
Kjell Gunnar Bleivik
Make it simple, as simple as possible but no simpler: | DigitalPunkt.no |

[begabloomers]

Kgun,

Do you have a definition of tuples, I am not familiar with this term.
_________________
http://www.lin-gerie.com
http://www.purecomforts.com
http://www.cellarstocker.com
Budget website design
http://www.redwebsitedesign.com

[KBleivik]

As a mathematical concept, yes. Here are two examples. You have to consult a book on mathematics to get an exact definition. I reccomend a book on set theory.

This:

(1,3,2)

is an unordered 3-tuple.

This

(1,2,3)

is an ordered.

It should be used in the same meaning in computer science. From a mathematical point of view, a computer programme is trivial. What makes a computer programme difficult is

1. Bad - unstructured programming.
2. Complexity. If it contains thousands and millions of lines with computer code, it is difficult to get an overview.
3. Object oriented programming, may seem difficult at a first glance, but it brings structure and reusability to your code.
_________________
Kjell Gunnar Bleivik
Make it simple, as simple as possible but no simpler: | DigitalPunkt.no |