NDLI: Search in the universe of big networks and data

Content Provider	IEEE Xplore Digital Library
Author	Gelenbe, E. Abdelrahman, O.
Copyright Year	1986
Abstract	Searching the Internet for some object characterized by its attributes in the form of data, such as a hotel in a certain city whose price is lower than some amount, is one of our most common activities when we access the web. We discuss this problem in a general setting, and compute the average amount of time and energy it takes to find an object in an infinitely large search space. We consider the use of N search agents that act concurrently in both the case where the search agent knows which way it needs to go to find the object, and the case where the search agent is completely ignorant and may even head away from the object being sought. We show that under mild conditions regarding the randomness of the search and the use of a time-out, the search agent will always find the object in spite of the fact that the search space is infinite. We obtain a formula for the average search time and the average energy expended by N search agents acting concurrently and independent of each other. We see that the time-out itself can be used to minimize the search time and the amount of energy that is consumed to find an object. An approximate formula is derived for the number of search agents that can help us guarantee that an object is found in a given time, and we discuss how the competition between search agents and other agents that try to hide the data object can be used by opposing parties to guarantee their own success.
Starting Page	20
Ending Page	25
Page Count	6
File Size	277496
File Format	PDF
ISSN	08908044
Volume Number	28
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Search problems Information retrieval Search methods Internet Probability density function Approximation methods Computers
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Information Systems Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Similarity Searching for the Big Data : Challenges and Research Objectives

Big data: transforming the design philosophy of future internet

Minimum Search Tree Structures for Data Partitioned into Pages

Multi-modal Similarity Retrieval with Distributed Key-value Store

Spatial big data and wireless networks: experiences, applications, and research challenges

Big Data: A Survey

Building a network highway for big data: architecture and challenges

A path-based approach for web page retrieval

Mobile Decentralized Search and Retrieval Using SMS and HTTP

Search in the universe of big networks and data

Similar Documents

Similarity Searching for the Big Data : Challenges and Research Objectives

Big data: transforming the design philosophy of future internet

Minimum Search Tree Structures for Data Partitioned into Pages

Multi-modal Similarity Retrieval with Distributed Key-value Store

Spatial big data and wireless networks: experiences, applications, and research challenges

Big Data: A Survey

Building a network highway for big data: architecture and challenges

A path-based approach for web page retrieval

Mobile Decentralized Search and Retrieval Using SMS and HTTP

Search in the universe of big networks and data