Sponsored Content
Full Discussion: Search Engine
Top Forums Web Development Search Engine Post 302519977 by DGPickett on Thursday 5th of May 2011 01:52:12 PM
Old 05-05-2011
You want a data structure that expands, updates, deletes in a other-user-invisible way, like leaf-to-root modification. Users coming down the old tree are not bothered by new trees you build to replace, or new subtrees.

A lot of code and though goes into dealing with kill-words, words and phrases that happen so often you never want to index them. You can discover them as they hit a threshold, or just trim them as needed for space.

JAVA using persistent objects may work well for this. You might want to make your own persistent objects out of map'd flat files.
 

5 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Search Engine

How do you write a search engline to search offline scripts? (3 Replies)
Discussion started by: hawaiifiver
3 Replies

2. Programming

Search Engine in C

Hello everybody, I need help with this, I need to design a CGI search engine in C but i have no idea on what or how to do it. Do i have to open all the html files one by one and search for the given strings? i think this process will be slow, and will take too much of the server processing... (11 Replies)
Discussion started by: semash!
11 Replies

3. Shell Programming and Scripting

About search engine in unix

Hello, How to create a search engine in unix using commands?...Atleast guidelines to craete this search engine...Thank you in advance. (10 Replies)
Discussion started by: Sindhu R
10 Replies

4. Homework & Coursework Questions

About search engine in unix

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: How to create a search engine in unix using commands?...Atleast guidelines to craete this search engine...Thank... (1 Reply)
Discussion started by: Sindhu R
1 Replies

5. What is on Your Mind?

YouTube: Search Engine Optimization | How To Fix Soft 404 Errors and A.I. Tales from Google Search

Getting a bit more comfortable making quick YT videos in 4K, here is: Search Engine Optimization | How To Fix Soft 404 Errors and A.I. Tales from Google Search Console https://youtu.be/I6b9T2qcqFo (0 Replies)
Discussion started by: Neo
0 Replies
snmpi(8)						      System Manager's Manual							  snmpi(8)

NAME
snmpi - The extensible SNMP subagent data initializer SYNOPSIS
/usr/sbin/snmpi [-d] [-p] [-n prefix] [-e exclude_file] defs_file {[-r] subtree}... OPTIONS
Specifies debug mode. Generates formatted output of the internal tree of all MIB objects defined in defs_file. This option is useful in identifying problems in MIB symbol resolution. Specifies a prefix string to be prepended to each variable generated by the snmpi program. Specifies the name of a file that contains a list of MIB objects that are not to be included in the emitted object table initialization code created by the program. Specifies the name of a MIB object identifier (OID) that defines the base of the MIB subtree that will be registered as a unit (with the snmpd daemon) by the subagent. (The snmpd daemon will subsequently expect the subagent to handle all MIB objects contained in the subtree.) Several subtrees may be specified, and at least one is required unless the -p option is used. If the base MIB object identifier is not unique, its name may be prefixed by its parents name, separated by an underscore character (_); for example, mn_system. The subtree parameter may also contain the suffix _tbl.h or _tbl.c to facilitate the use of snmpi within makefiles. For each subtree parameter specified, snmpi produces the files subtree _tbl.h, subtree_tbl.c, and subtree_tbl.txt. If the optional -r option is specified, the OID that defines the base of the MIB subtree is the lower bound (OID of the first leaf object in the MIB subtree) of the range of objects that make up a MIB subtree row. The upper bound (OID of the last leaf object in the MIB subtree) is contained in an ESNMP_REG structure, subtree_reg, in the subtree_tbl.c file. The snmpi program produces the sub- tree_reg structure. If you use the -r option, all objects in the MIB subtree must be leaf objects occuring at the same level. This means that the length of the OID for each object defined in the MIB subtree must be the same and that each object defined in the MIB subtree must be a leaf object (OID length is the same). You can register the MIB subtree row by specifying the ESNMP_REG structure as the parameter to the esnmp_register2() routine. You can unregister the MIB subtree row by specifying the generated ESNMP_REG structure to the esnmp_unregister2() routine. OPERANDS
Specifies a mosy output file or a concatenation of mosy output files. DESCRIPTION
The snmpi program emits subtree object table initialization C code to be compiled and linked with the method routines as part of an exten- sible SNMP subagent. For a complete description of using snmpi refer to the Network Programmer's Guide. FILES
Template exclusion file SEE ALSO
Commands: mosy(8), snmpd(8), snmp_request(8) Network Programmer's Guide IDENTIFICATION
Originally, this work was partially supported by the U.S. Defense Advanced Research Projects Agency and the Rome Air Development Center of the U.S. Air Force Systems Command under contract number F30602-88-C-0016. Marshall T. Rose wrote the original (insecure) 4BSD/ISODE SNMP package. David L. Partain of the Department of Computer and Information Science at Linkoping University, Sweden added most of the administrative facilities as a part of his Masters work at the University of Tennessee, Knoxville. Dr. Jeffrey D. Case of SNMP Research supervised his work, and Keith McCloghrie of Hughes LAN Systems provided implementation guidance. Major modifications to the code were made as part of the extensible SNMP Agent for Tru64 UNIX. snmpi(8)
All times are GMT -4. The time now is 10:49 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy