Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > sci.physics > #644492 > unrolled thread

Odd, God and my invention of Googling not that it was known as such in 1986-87

Back to article view | Back to sci.physics

Contents

  Odd, God and my invention of Googling not that it was known as such in 1986-87 Arindam Banerjee <banerjeeadda1234@gmail.com> - 2017-08-05 01:08 -0700
    Re: Odd, God and my invention of Googling not that it was known as such in 1986-87 Odd Bodkin <bodkinodd@gmail.com> - 2017-08-05 11:52 -0500
      Re: Odd, God and my invention of Googling not that it was known as such in 1986-87 Arindam Banerjee <banerjeeadda1234@gmail.com> - 2017-08-05 23:54 -0700
        Re: Odd, God and my invention of Googling not that it was known as such in 1986-87 Odd Bodkin <bodkinodd@gmail.com> - 2017-08-07 08:19 -0500
          Re: Odd, God and my invention of Googling not that it was known as such in 1986-87 Arindam Banerjee <banerjeeadda1234@gmail.com> - 2017-08-07 17:20 -0700
    Re: Odd, God and my invention of Googling not that it was known as such  in 1986-87 The Starmaker <starmaker@ix.netcom.com> - 2017-08-05 10:59 -0700
      Re: Odd, God and my invention of Googling not that it was known as such   in 1986-87 The Starmaker <starmaker@ix.netcom.com> - 2017-08-05 14:55 -0700
      Re: Odd, God and my invention of Googling not that it was known as such in 1986-87 D B Davis <g@crcomp.net> - 2017-08-05 22:23 +0000

#644492 — Odd, God and my invention of Googling not that it was known as such in 1986-87

Thank God for Odd!

> Compare and contrast with Arindam Banerjee who stated "I invented googling".

As part of my M.Tech thesis in Computer Science from IIT Delhi in 1986.
Thesis Title: Information Systems based on Partial-Match Retrieval

Paper: "A New Method for Partial Match Retrievals" International Conference
on Supercomputing, Santa Clara, 1987

Abstract:
This paper presents and analyses a new method for a simple, direct and fast
solution of the partial-match problem. An algorithm is developed to derive a 
pointer for every partial-match query; this pointer locates a block in the 
address directory which gives a sequence of relative addresses in the only
relatively ordered database. Extra information in the query, making it a
"tuning" one, will arrange such records in an ascending or descending order of
desirability. Investigation is done about the size of the address directory, 
which depends upon the total number of allowable queries (a function of the
cardinalities of the domains of every partial-match attribute), and also the
average number of record addresses per query.

Cheers,
Arindam Banerjee

[toc] | [next] | [standalone]

#644572

On 8/5/17 3:08 AM, Arindam Banerjee wrote:
> Thank God for Odd!
> 
>> Compare and contrast with Arindam Banerjee who stated "I invented googling".
> 
> As part of my M.Tech thesis in Computer Science from IIT Delhi in 1986.
> Thesis Title: Information Systems based on Partial-Match Retrieval
> 
> Paper: "A New Method for Partial Match Retrievals" International Conference
> on Supercomputing, Santa Clara, 1987
> 
> Abstract:
> This paper presents and analyses a new method for a simple, direct and fast
> solution of the partial-match problem. An algorithm is developed to derive a
> pointer for every partial-match query; this pointer locates a block in the
> address directory which gives a sequence of relative addresses in the only
> relatively ordered database. Extra information in the query, making it a
> "tuning" one, will arrange such records in an ascending or descending order of
> desirability. Investigation is done about the size of the address directory,
> which depends upon the total number of allowable queries (a function of the
> cardinalities of the domains of every partial-match attribute), and also the
> average number of record addresses per query.
> 
> Cheers,
> Arindam Banerjee
> 

Two comments: Doug Englebart demonstrated partial match retrievals in 
1968 in the famous "Mother of all demos".
Second, Google's success was based on backlink ranking and the PageRank 
algorithm, not on partial match retrievals, which were already 
implemented on Yahoo, Hotbot, Lycos and other search engines at the time.

-- 
Odd Bodkin -- maker of fine toys, tools, tables

[toc] | [prev] | [next] | [standalone]

#644755

On Sunday, August 6, 2017 at 2:52:05 AM UTC+10, Odd Bodkin wrote:
> On 8/5/17 3:08 AM, Arindam Banerjee wrote:
> > Thank God for Odd!
> > 
> >> Compare and contrast with Arindam Banerjee who stated "I invented googling".
> > 
> > As part of my M.Tech thesis in Computer Science from IIT Delhi in 1986.
> > Thesis Title: Information Systems based on Partial-Match Retrieval
> > 
> > Paper: "A New Method for Partial Match Retrievals" International Conference
> > on Supercomputing, Santa Clara, 1987
> > 
> > Abstract:
> > This paper presents and analyses a new method for a simple, direct and fast
> > solution of the partial-match problem. An algorithm is developed to derive a
> > pointer for every partial-match query; this pointer locates a block in the
> > address directory which gives a sequence of relative addresses in the only
> > relatively ordered database. Extra information in the query, making it a
> > "tuning" one, will arrange such records in an ascending or descending order of
> > desirability. Investigation is done about the size of the address directory,
> > which depends upon the total number of allowable queries (a function of the
> > cardinalities of the domains of every partial-match attribute), and also the
> > average number of record addresses per query.
> > 
> > Cheers,
> > Arindam Banerjee
> > 
> 
> Two comments: Doug Englebart demonstrated partial match retrievals in 
> 1968 in the famous "Mother of all demos".

There were many papers written on partial-match retrievals before mine.
They all had differing approaches to handling the above problem.

I found out a new method which worked on emphasising the importance of 
relational databases as opposed to others like hierarchical and network.

In 1986 relational databases were very slow.
But after 1986 computers and communications really took off and so relational
databases with their simplicity became the norm.


> Second, Google's success was based on backlink ranking and the PageRank 
> algorithm, not on partial match retrievals, which were already 
> implemented on Yahoo, Hotbot, Lycos and other search engines at the time.

My method is very general. It can be modified for various
implementations. I have not worked with this idea after I came to Australia
where I did other software work in telecom. But my first work (after which I
got confirmed) was to complete an X.500 directory implementation using the 
same approach. It was a very highly successful product in Telstra as it 
allowed the management to know who was working where. 

I think my method could be used to make very fast decisions on a look up basis.
Should be useful in robotics. In conjunction with my last software work on 
message passing, these approaches could make awesomely powerful robots.

Better use them in outer space with my internal force engines!
Cheers,
Arindam Banerjee
> 
> -- 
> Odd Bodkin -- maker of fine toys, tools, tables

[toc] | [prev] | [next] | [standalone]

#644932

On 8/6/17 1:54 AM, Arindam Banerjee wrote:
> On Sunday, August 6, 2017 at 2:52:05 AM UTC+10, Odd Bodkin wrote:
>> On 8/5/17 3:08 AM, Arindam Banerjee wrote:
>>> Thank God for Odd!
>>>
>>>> Compare and contrast with Arindam Banerjee who stated "I invented googling".
>>>
>>> As part of my M.Tech thesis in Computer Science from IIT Delhi in 1986.
>>> Thesis Title: Information Systems based on Partial-Match Retrieval
>>>
>>> Paper: "A New Method for Partial Match Retrievals" International Conference
>>> on Supercomputing, Santa Clara, 1987
>>>
>>> Abstract:
>>> This paper presents and analyses a new method for a simple, direct and fast
>>> solution of the partial-match problem. An algorithm is developed to derive a
>>> pointer for every partial-match query; this pointer locates a block in the
>>> address directory which gives a sequence of relative addresses in the only
>>> relatively ordered database. Extra information in the query, making it a
>>> "tuning" one, will arrange such records in an ascending or descending order of
>>> desirability. Investigation is done about the size of the address directory,
>>> which depends upon the total number of allowable queries (a function of the
>>> cardinalities of the domains of every partial-match attribute), and also the
>>> average number of record addresses per query.
>>>
>>> Cheers,
>>> Arindam Banerjee
>>>
>>
>> Two comments: Doug Englebart demonstrated partial match retrievals in
>> 1968 in the famous "Mother of all demos".
> 
> There were many papers written on partial-match retrievals before mine.
> They all had differing approaches to handling the above problem.
> 
> I found out a new method which worked on emphasising the importance of
> relational databases as opposed to others like hierarchical and network.
> 
> In 1986 relational databases were very slow.
> But after 1986 computers and communications really took off and so relational
> databases with their simplicity became the norm.
> 
> 
>> Second, Google's success was based on backlink ranking and the PageRank
>> algorithm, not on partial match retrievals, which were already
>> implemented on Yahoo, Hotbot, Lycos and other search engines at the time.
> 
> My method is very general. It can be modified for various
> implementations. I have not worked with this idea after I came to Australia
> where I did other software work in telecom. But my first work (after which I
> got confirmed) was to complete an X.500 directory implementation using the
> same approach. It was a very highly successful product in Telstra as it
> allowed the management to know who was working where.

Here's the thing. It really doesn't matter how much your unutiliized 
idea has potential, in your eyes.

The fact is, your idea has nothing to do with "inventing googling", 
because how Google works has nothing to do with your idea. So when you 
claimed that you invented googling, you were lying, pure and simple.

People with character defects like that do not get treated seriously in 
life, as you are experiencing.

> 
> I think my method could be used to make very fast decisions on a look up basis.
> Should be useful in robotics. In conjunction with my last software work on
> message passing, these approaches could make awesomely powerful robots.
> 
> Better use them in outer space with my internal force engines!
> Cheers,
> Arindam Banerjee
>>
>> -- 
>> Odd Bodkin -- maker of fine toys, tools, tables
> 


-- 
Odd Bodkin -- maker of fine toys, tools, tables

[toc] | [prev] | [next] | [standalone]

#645052

On Monday, August 7, 2017 at 11:20:04 PM UTC+10, Odd Bodkin wrote:
> On 8/6/17 1:54 AM, Arindam Banerjee wrote:
> > On Sunday, August 6, 2017 at 2:52:05 AM UTC+10, Odd Bodkin wrote:
> >> On 8/5/17 3:08 AM, Arindam Banerjee wrote:
> >>> Thank God for Odd!
> >>>
> >>>> Compare and contrast with Arindam Banerjee who stated "I invented googling".
> >>>
> >>> As part of my M.Tech thesis in Computer Science from IIT Delhi in 1986.
> >>> Thesis Title: Information Systems based on Partial-Match Retrieval
> >>>
> >>> Paper: "A New Method for Partial Match Retrievals" International Conference
> >>> on Supercomputing, Santa Clara, 1987
> >>>
> >>> Abstract:
> >>> This paper presents and analyses a new method for a simple, direct and fast
> >>> solution of the partial-match problem. An algorithm is developed to derive a
> >>> pointer for every partial-match query; this pointer locates a block in the
> >>> address directory which gives a sequence of relative addresses in the only
> >>> relatively ordered database. Extra information in the query, making it a
> >>> "tuning" one, will arrange such records in an ascending or descending order of
> >>> desirability. Investigation is done about the size of the address directory,
> >>> which depends upon the total number of allowable queries (a function of the
> >>> cardinalities of the domains of every partial-match attribute), and also the
> >>> average number of record addresses per query.
> >>>
> >>> Cheers,
> >>> Arindam Banerjee
> >>>
> >>
> >> Two comments: Doug Englebart demonstrated partial match retrievals in
> >> 1968 in the famous "Mother of all demos".
> > 
> > There were many papers written on partial-match retrievals before mine.
> > They all had differing approaches to handling the above problem.
> > 
> > I found out a new method which worked on emphasising the importance of
> > relational databases as opposed to others like hierarchical and network.
> > 
> > In 1986 relational databases were very slow.
> > But after 1986 computers and communications really took off and so relational
> > databases with their simplicity became the norm.
> > 
> > 
> >> Second, Google's success was based on backlink ranking and the PageRank
> >> algorithm, not on partial match retrievals, which were already
> >> implemented on Yahoo, Hotbot, Lycos and other search engines at the time.
> > 
> > My method is very general. It can be modified for various
> > implementations. I have not worked with this idea after I came to Australia
> > where I did other software work in telecom. But my first work (after which I
> > got confirmed) was to complete an X.500 directory implementation using the
> > same approach. It was a very highly successful product in Telstra as it
> > allowed the management to know who was working where.
> 
> Here's the thing. It really doesn't matter how much your unutiliized 
> idea has potential, in your eyes.

It was utilised all right to set the world on googling in due course.

It all had to come from one idea.
Just as the bungler Einstein started the horror of relativity with his 1905
paper.
Nature requires a balance, so to the insanity and evil of relativity Nature
provided myself and my 1986 work which led to the efficient searching of databases with relational methods.

Whether or not the firstworld racist+bigoted devils give me any credit is not
a subject that bothers me. 

Hmm, I think that as there is no electronic copy of that paper, I should put it
up on my facebook page for everyone to read and comment.

Cheers,
Arindam Banerjee

[toc] | [prev] | [next] | [standalone]

#644592 — Re: Odd, God and my invention of Googling not that it was known as such in 1986-87

Arindam Banerjee wrote:
> 
> Thank God for Odd!
> 
> > Compare and contrast with Arindam Banerjee who stated "I invented googling".
> 
> As part of my M.Tech thesis in Computer Science from IIT Delhi in 1986.
> Thesis Title: Information Systems based on Partial-Match Retrieval
> 
> Paper: "A New Method for Partial Match Retrievals" International Conference
> on Supercomputing, Santa Clara, 1987
> 
> Abstract:
> This paper presents and analyses a new method for a simple, direct and fast
> solution of the partial-match problem. An algorithm is developed to derive a
> pointer for every partial-match query; this pointer locates a block in the
> address directory which gives a sequence of relative addresses in the only
> relatively ordered database. Extra information in the query, making it a
> "tuning" one, will arrange such records in an ascending or descending order of
> desirability. Investigation is done about the size of the address directory,
> which depends upon the total number of allowable queries (a function of the
> cardinalities of the domains of every partial-match attribute), and also the
> average number of record addresses per query.
> 
> Cheers,
> Arindam Banerjee



Google is interested in have the *most* backlinks shown in the world.


If you try to do a search with "", it will cut down on the amount of backlinks shown,
and you will also notice today...Google will try to remove those quotation marks ""
from your searches.


Partial-Match is a death for search engines. 


They (Google) are now removing certain keywords and consolidating it with a bigger keyword to increase backlinks.

So, if you type a small audience keyword, Google will consolidated it to the top keyword of it's catergory.

The result... an increase in income adverting revenue for Google top keywords used.

So, it your trafffic for your top keyword seems to double lately, now you know why.

[toc] | [prev] | [next] | [standalone]

#644635 — Re: Odd, God and my invention of Googling not that it was known as such in 1986-87

The Starmaker wrote:
> 
> Arindam Banerjee wrote:
> >
> > Thank God for Odd!
> >
> > > Compare and contrast with Arindam Banerjee who stated "I invented googling".
> >
> > As part of my M.Tech thesis in Computer Science from IIT Delhi in 1986.
> > Thesis Title: Information Systems based on Partial-Match Retrieval
> >
> > Paper: "A New Method for Partial Match Retrievals" International Conference
> > on Supercomputing, Santa Clara, 1987
> >
> > Abstract:
> > This paper presents and analyses a new method for a simple, direct and fast
> > solution of the partial-match problem. An algorithm is developed to derive a
> > pointer for every partial-match query; this pointer locates a block in the
> > address directory which gives a sequence of relative addresses in the only
> > relatively ordered database. Extra information in the query, making it a
> > "tuning" one, will arrange such records in an ascending or descending order of
> > desirability. Investigation is done about the size of the address directory,
> > which depends upon the total number of allowable queries (a function of the
> > cardinalities of the domains of every partial-match attribute), and also the
> > average number of record addresses per query.
> >
> > Cheers,
> > Arindam Banerjee
> 
> Google is interested in have the *most* backlinks shown in the world.
> 
> If you try to do a search with "", it will cut down on the amount of backlinks shown,
> and you will also notice today...Google will try to remove those quotation marks ""
> from your searches.
> 
> Partial-Match is a death for search engines.
> 
> They (Google) are now removing certain keywords and consolidating it with a bigger keyword to increase backlinks.
> 
> So, if you type a small audience keyword, Google will consolidated it to the top keyword of it's catergory.
> 
> The result... an increase in income adverting revenue for Google top keywords used.
> 
> So, if your trafffic for your top keyword seems to double lately, now you know why.


You could even be paying double to Google if your small keyword and your
big keyword match in traffic results.

[toc] | [prev] | [next] | [standalone]

#644644

The Starmaker <starmaker@ix.netcom.com> wrote:

<snip>

> If you try to do a search with "", it will cut down on the amount of backlinks shown,
> and you will also notice today...Google will try to remove those quotation marks ""
> from your searches.

Sweet. That little hack restores google's IQ up to where it was at
google's inception back in the 1990s. Every hit now contains useful
information again. This makes google worthy enough to become my primary
search engine once more.

If this continues all of those google domains in my DNS blacklist may
one day see the light of day again. Naw. j/k. That's never going to
happen. There are limits after all.

Thank you,

--
Don

[toc] | [prev] | [standalone]

Back to top | Article view | sci.physics

csiph-web