Abstract: A search server interconnection method, a search server, and a system for mobile search are disclosed The method includes: sending an information list of a first group of member engines to a search server; receiving an information list of a second group of member engines, where the information list of the second group of member engines is returned by the search server; and sending meta-index information of member engines in the information list of the second group of member engines to the search server. In the present invention, an effective mobile search service across search servers is realized.

Abstract: A method for creating a search index on cloud database is provided. The method enables providing inputs for creating multiple indexes on documents stored in the cloud database. One of the inputs may include a first value representing number of documents to be assigned a single index. The method further enables determining total number of documents stored in the cloud database which is represented by a second value. Further, the method enables estimating total number of indexes to be created based on first value and second value. The method further comprises executing a loop to create multiple indexes for a predetermined number of iterations which corresponds to the estimated value. Furthermore, the method comprises indexing documents for creating the multiple indexes. Finally, the method comprises merging the multiple indexes to create a single index which facilitates a user to search documents stored in the cloud database.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for index-side synonym expansion are disclosed. Some implementations include actions of obtaining a token sequence for a resource, wherein each token in the token sequence comprises one or more characters. The actions also include selecting a token from the token sequence, wherein the selected token comprises at least one numeric portion having one or more contiguous numeric characters, and at least one non-numeric portion having one or more non-numeric characters. Further actions include generating a new token corresponding to each of the at least one numeric portions of the selected token and storing data associating the selected token and each of the new tokens corresponding to the at least one numeric portion of the selected token as index terms for the resource, wherein the search engine index is accessed to augment search queries.

Abstract: Technologies are described herein for probabilistically assigning weights to word senses and hypernyms of a word. The weights can be used in natural language processing applications such as information indexing and querying. A word hypernym weight (WHW) score can be determined by summing word sense probabilities of word senses from which the hypernym is inherited. WHW scores can be used to prune away hypernyms prior to indexing, to rank query results, and for other functions related to information indexing and querying. A semantic search technique can use WHW scores to retrieve an entry related to a word from an index in response to matching an indexed hypernym of the word with a query term applied to the index. More refined and accurate query results may be provided based on reduced user inputs.

Abstract: A server contains an executable program and is in communication with an online social network. The server is accessed by a subscriber on a client system executing an application program interface to communicate with the server in which the server accesses indexes of data maintained on an online social network platform and retrieves the accessed data. The subscriber creates an account on the server. The executable program builds an index of relevant content for that subscriber to retrieve. The data is processed and aggregated on the server through a subscriber-specific relevancy engine on the server and the aggregated data is delivered to the subscriber on the client system in a searchable database. The subscriber may execute a search query on the client system in communication with the server and search query is processed returning relevant results to the user.

Abstract: Collecting and analyzing crime related information is one of the most important tasks of law enforcement agencies. Traditionally, crime related information is entered into structured database that allows law enforcement officers to later search the database. However, the user interface is often not well suited for easily finding relevant documents quickly. To improve the situation, a law enforcement information system that stores data in two different types of formats is disclosed. Crime related information is stored both in a traditional structured database and in a modified natural language database. The modified natural language database is then indexed and may be searched with an internet search engine type of user interface.

Abstract: A page splitter may be configured to split a first page of a site into first boilerplate and first posts, and a second page of the site into second boilerplate and second posts. An aggregator may be configured to associate the first page with the second page, based on a similarity of the first boilerplate and the second boilerplate, and configured to associate at least one of the first posts and at least one of the second posts with a first post-type, and at least one of the second posts with a second post-type. A merger may be configured to merge the first boilerplate and the second boilerplate into a boilerplate template, posts of the first post-type from the first page and from the second page into a first post-type template, and posts of the second post-type from the second page into a second post-type template, and further configured to merge the boilerplate template, the first post-type template, and the second post-type template into a site template associated with the site.

Abstract: The present invention provides a system, method and apparatus for electronically searching for an item by receiving a search request comprising a requested category and one or more requested attributes of the item and storing the search request in a search index based on the requested category and the requested attribute(s). The search index includes one or more categories and each category is defined by a taxonomy of attributes. The search index is then searched for any previously stored search requests that match the requested category and the requested attribute(s), a result of the search is determined and a search response that includes the result of the search is sent.

Abstract: Database query analysis technology, in which an input query is received that relates to multiple attribute classes of data records. An index that is descriptive of the data records in data storage is accessed and relative positions in the accessed index for the multiple attribute classes are identified. The accessed index is processed based on more than one of the multiple attribute classes and the identified relative positions, and the processed index is used to identify groups of data records that are included in the data records in the data storage and that share common values for the multiple attribute classes in the input query. Metrics corresponding to the data records included in each of the identified groups of data records are accessed, computations are performed on the accessed metrics, and a report is generated that reflects results of the computations.

Abstract: An information retrieval system comprising: an information acquisition unit that acquires information as a subject of retrieval; a time information specifying unit that specifies time information owned by said information as the subject of retrieval; and an index updating unit that updates said index using the time information specified by said time information specifying unit; wherein said information retrieval system provides an information retrieving function of reproducing retrieved results at any time point by providing index for information retrieval with the time information and by using data of said index relevant to a reference point of retrieval identified at the time of retrieval.

Abstract: Embodiments of the disclosed innovations provide systems and methods for locating data associated with rendered documents. Some embodiments support the use of a handheld document data capture device.

Abstract: An analysis system is configured to perform quantitative (e.g., statistical) and/or qualitative analysis of large numbers of documents, files, etc., such as web pages, images on web pages, social medial pages, or other documents available via the Internet, an extranet, an Intranet, etc. In some embodiments, the large numbers of documents, files, etc., may be treated as a data set that can be quantitatively analyzed and reports of such analyses may be made electronically available to a user.

Abstract: Sketch and tagging based image search may include receiving a sketch query input and identifying an object in a desired image. The object or objects of the sketch query may be tagged with a text, and searching performed based on the objects. Certain implementations include indexing patches of the images, where the patches represent the objects. Relevant images can be returned based on the index of the patches.

Abstract: A computer-implemented method and system are provided for storing selected e-mails, including the content of the e-mail and attachments, in a document management system. A user initiates storage of the e-mail by a user-actuated control that is added to the interface of his e-mail application. The e-mail is then copied, indexed and stored in a separate document in the document management system, and attachments to the e-mail are embedded in the separate document. The font and graphics of the e-mail may be stored in the separate document as they as they appeared in the original document. The text of the e-mail may be stored in the binary format that is native to a word processor associated with the document management system.

Abstract: A system includes a server to store content and a content searching system. The content search system includes an application programming interface to receive user-selected metadata uploaded from a first user, where the metadata includes data that describes content stored at a server. The content searching system further includes an indexer to index the metadata to produce a metadata search index, a search engine to search the metadata search index based on a search query received from a user to produce metadata search results, and a delivery engine to send the metadata search results, and a link to the remote server, to the user to permit the user to access the content stored at the remote server.

Abstract: Methods, program products, and systems implementing integrated repository of structured and unstructured data are disclosed. An integrated environment is provided for accessing structured data (e.g., data of a relational database) and unstructured data (e.g., data stored in a text or binary file), including creating, managing, modifying, and searching the structured data and unstructured data. The integrated environment can include an integrated user interface, a set of commands and application programming interface (API), and storage for a relational database and a document repository. The integrated environment can include a database abstraction layer that allows database operations on both the structured data and the unstructured data.

Abstract: Concepts and technologies are described herein for generating and presenting deep links. In accordance with the concepts and technologies disclosed herein a search engine is configured to generate deep links associated with a site. A site is identified by the search engine and the site is analyzed by the search engine with data relating to searches of and/or usage of the site. The search engine identifies links or other resources contained in, associated with, or referenced by the site, generates deep links corresponding to the resources, and associates the deep links with the site. If a site having indexed deep links is identified in search results, the search engine identifies one or more deep links associated with the site and presents the deep links with the search results to provide a searcher with relevant resources that may not satisfy the search query submitted by the searcher.

Abstract: Systems and methods for reformulating an initial search query and presenting query results in a logical and user-friendly manner. Enterprise queries are detected and automatically reformulated such that a user need not have any knowledge of how to reformulate a particular query. Query results are formatted and presented such that standard browsing behavior of the user is not substantially altered. The user is made aware of how the query has been reformulated, and how to get more results of that type without changing their gaze patterns.

Abstract: A method and search engine for classifying a source publishing a document on a portion of a network, includes steps of electronically receiving a document, based on the document, determining a source which published the document, and assigning a code to the document based on whether data associated with the document published by the source matches with data contained in a database. An intelligent geographic- and business topic-specific resource discovery system facilitates local commerce on the World-Wide Web and also reduces search time by accurately isolating information for end-users. Distinguishing and classifying business pages on the Web by business categories using Standard Industrial Classification (SIC) codes is achieved through an automatic iterative process.

Abstract: Exemplary embodiments include a search engine indexing method, including finding a page on a server that includes keywords, scanning the page for a tag designating a portion of the page from which to index the keywords and in response to a presence of the tag within the page, indexing the portion of the page that is designated by the tag.

Abstract: A server may identify a first address stored in a first search index; determine one or more first identifiers associated with the first address; identify a second address stored in a second search index; determine one or more second identifiers associated with the second address; map the first address to the second address based on a first identifier, of the one or more first identifiers, and a second identifier, of the one or more second identifiers; and transmit the mapping, of the first address to the second address, to a first server associated with the first search index or to a second server associated with the second search index.

Abstract: A system receives a document that includes new content and aged content, and compares the document with a prior version of the document that includes the aged content but not the new content. The system also separates the new content and the aged content based on the comparison, determines ages associated with the new content and the aged content, and determines whether the ages of the new content and the aged content are greater than or equal to an age threshold. The system further calculates a checksum of the document based on the aged content when the age of the aged content is greater than or equal to the age threshold, and the age of the new content is less than the age threshold, and stores the calculated checksum.

Abstract: Disclosed are various embodiments for managing data indexed by a search engine. A respective identifier from a set of identifiers is assigned randomly in one or more computing devices to each one of a plurality of data records. A set of search queries is provided. A first one of the search queries encompasses all of the set of identifiers. A second search index is generated from a first search index of the data records. The first search index is queried for at most a predetermined number of unmarked ones of the data records using a search query. Each one of a result set of data records that is thereby obtained is inserted into the second search index. The result set of data records is marked in the first search index.

Abstract: A system and method for identifying a document based on a spectral analysis of the text of the document is described. In some examples, the system generates a document identifier for a rendered document based on assigning values to words in the rendered document, such as values associated with the frequency of use of the word by the rendered document, the absolute or relative position of the word in the rendered document, and so on. The system may use the document identifier to generate a group of documents having similar document identifiers, and choose a likely match from the group of documents based on predictive analysis.

Abstract: Methods and systems for a web crawler scheduler that utilizes sitemaps from websites are described. A web crawler scheduling system receives a notification from a website or web server. In response to the notification, the system accesses one or more sitemap(s) for documents associated with the website or web server. The system schedules crawls of the documents based on information identified from the sitemaps. The system crawls at least a subset of the documents scheduled for crawling.

Abstract: Update processing and the like of an index file relating to change of a hierarchical structure is performed. The index file is recorded in a recording medium with content files. The index file is generated based on attribute information of content files and folders including the content files. Content files and folders form a hierarchical structure in which the folders are in an upper hierarchy. In the index file, a prescribed number of entries (management information areas) corresponding to content files and folders, respectively, are provided. Second index information indicating second entries corresponding to folders or content files positioned in a lower hierarchy of folders in the upper hierarchy is provided at first entries corresponding to folders in the upper hierarchy in a list format. First index information indicating the first entries is provided at the second entries.

Abstract: A document analysis, commenting, and reporting system provides tools that automate quality assurance analysis tailored to specific document types. As one example, the specific document type may be a requirements specification and the system may tag different parts of requirements, including actors, entities, modes, and a remainder. However, the flexibility of the system permits analysis of any other document type, such as instruction manuals and best practices guides. The system helps avoid confusion over the document when it is delivered because of non-standard terms, ambiguous language, conflicts between document sections, incomplete or inaccurate descriptions, size and complexity of the document, and other issues.

Abstract: A database system uses indexes to improve performance. The system can use one or more of the following: differentiated subfields for index clustering; set function calculations to reduce the amount of I/O; and/or using an inferred index in a circular table.

Abstract: This invention provides a method, system, and apparatus for generating and manipulating the structure of user interface control hierarchies. When a web page is requested from a server by client software an initial control hierarchy configuration is generated. Upon successive requests by the client to the server, the structure of the web control hierarchy generated for the given web page may be altered, as prescribed by the specifications. The nature of those alterations can include the addition or replacement of web control sub-structures. This invention can be utilized to manipulate dynamic control hierarchies generated within a statically-generated hierarchy.

Abstract: A method and system for storing and searching digital documents, such as digital catalogs, are described. The method in one embodiment comprises inputting digital documents, extracting content from the digital documents, and storing the extracted content in a database so that the content is searchable. The method can include generating a hierarchy of unique database and CMS objects from document covers and pages plus meta data. The method can further include receiving a search query from a user and, in response, identifying content extracted from one of the digital documents and stored in the database, which satisfies the query. The method can further include causing a result set to be output to the user, where the result set includes the identified content which satisfies the search query and an image of a particular page of the digital document from which the identified content was extracted.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for correcting entity names. One method includes receiving texts and deriving a plurality of name-context pairs from the texts. The method further includes calculating a context consistency measure for each name-context pair and storing context-entity name data representing the name-context pairs. Another method includes identifying an entity name and one or more context terms from a query and generating candidate names for the entity name. The method further includes determining a score for each of the candidate names, selecting a number of top scoring candidate names, and using the selected candidate names to respond to the query.

Abstract: A computer-implemented method is provided for searching for files on the Internet. In one embodiment, the method may provide an application crawler that assembles and dynamically instantiates all components of a web page. The instantiated web application may then be analyzed to locate desired components on the web page. This may involve finding and analyzing all clickable items in the application, driving the web application by injecting events, and extracting information from the application and writing it to a file or database.

Abstract: Various embodiments enable a web site to expose various search providers that it promotes to browsers that navigate to that site. In at least some embodiments, the search providers are exposed using the HTML of a web page. When a browser navigates to that site, it processes the HTML of the associated web page and exposes the promoted search providers to the user. In at least some embodiments, the browser can permit use of one or more search providers without requiring the user to install the search provider. Alternately or additionally, in at least some other embodiments, the browser can enable the user to quickly and efficiently install the search provider so that the search provider can be available whenever the user uses their browser application.

Abstract: Methods and systems for automatic detection of landmarks in digital images and annotation of those images are disclosed. A method for detecting and annotating landmarks in digital images includes the steps of automatically assigning a tag descriptive of a landmark to one or more images in a plurality of text-associated digital images to generate a set of landmark-tagged images, learning an appearance model for the landmark from the set of landmark-tagged images, and detecting the landmark in a new digital image using the appearance model. The method can also include a step of annotating the new image with the tag descriptive of the landmark.

Abstract: A system is configured to modify a website to optimize the website for an organic search of a topic. The system includes a data management module configured to receive search terms for the topic, receive related terms to the search terms for the topic, and receive website input data. The system also includes a scanning module configured to scan and index web pages and web objects in the website and identify a subset of web pages and web objects associated with the search terms and the related terms. The system also includes an optimizing module configured to process the subset of web pages and web objects from the website by prioritizing the subset of web pages and web objects or measuring a metric with respect to the subset of web pages and web objects. The search terms and related terms are deployed into the subset of web pages and web objects on the website based on the processing.

Abstract: In an embodiment, a threshold value is calculated for a current entry in a first column of an index. If the current entry has been read a number of times by execution of an execution plan that is more than the threshold value and the current entry points to at least one row in a table and not all of the at least one row have been selected by the execution plan for inclusion in a result set as satisfying a query that the execution plan implements, then a new entry is added to the index.

Abstract: A method for displaying values specified in a number of offers for a number of offer variables with respect to price includes receiving data for multiple offers that reflects values specified in the offers for multiple offer variables and generating a display of the received data. The display includes multiple offer variable windows that are each associated with an offer variable. Each offer variable window includes an offer price axis representing a range of offer prices and an offer variable axis substantially perpendicular to the offer price axis that represents a range of values for the offer variable associated with the offer variable window. Each offer variable window includes multiple bars. Each bar represents a value specified in offer for the offer variable associated with the offer variable window and is positioned with respect to the offer price axis according to an offer price specified in the offers.

Abstract: A high-density, distance-measuring laser system and an associated computer that processes the data collected by the laser system. The computer determines a data partition structure and stores that structure as a header file for the scan before data is collected. As the scan progresses, the computer collects data points until a predetermined threshold is met, at which point a block of data consisting of the data points up to the threshold is written to disk. The computer indexes each data block using all three coordinates of its constituent data points using, preferably, a flexible index, such as an R-tree. When a data block is completely filled, it is written to disk preferably with its index and, as a result, each data block is ready for access and manipulation virtually immediately after having been collected. Also, each data block can be independently manipulated and read from disk.

Abstract: Ethernet ‘operation, administration and management’ (OAM) circuits contain monitoring points that exchange ‘management” messages, particularly connectivity fault management messages and performance monitoring messages. This invention is a search process to identify a receiving monitoring point and also a further process to verify, particularly for continuity check messages, a management endpoint. The search processes use information carried in a message, in a hardware efficient method with predictable search times independent of search table size.

Abstract: A method, machine readable storage medium, and system for providing a self learning semantic search engine. A semantic network may be set up with initial configuration. A search engine coupled to the semantic network may build indexes and semantic indexes. A user request for business data may be received. The search engine may be accessed via a semantic dispatcher. And based on the access, search engine may update the indexes and semantic indexes.

Abstract: Embodiments of the invention form an information set from the current set of index information available by the operations of the Pre-Search and RunTime Search components of the search engine. A search request that contains search terms and/or other search criteria (e.g. date or file type) is entered by a user through an input interface. The search terms and the information set are worked through the search engine modules to provide the actual results sought by the user. These results are provided to the user via a Return Interface. Embodiments involve a search engine that forms a numeric code index that includes grammar embedded rules from a plurality of documents, converts a search request into the same format as the index, and then compares the index and the search request to form the search results.

Abstract: Generating a standby index on a standby database server in a physical log-shipping data replication environment. Embodiments of the invention include providing a primary database server and a standby database server, replicating a primary database and a primary database index from the primary database server to the standby database server, generating a standby index on the standby database server, and cataloging the standby index on the standby database server.

Abstract: A method and apparatus for proxying search requests for a storage system and maintaining a central index for performing the search requests is described herein. An index manager on the storage system may initially produce the central index by examining each file in a file system and update the central index thereafter by examining only those files that have changed since the central index was initially produced or last updated. The index manager may receive a changed file list from a differencing layer configured for comparing snapshots of the file system at different time points to produce changed file lists. A search proxy module may receive search requests in a search protocol and proxy the search requests to a search engine by converting the search requests to another search protocol compatible with the search engine. The search engine may then use the central index for performing the search request.

Abstract: Methods and computing devices enable users to identify documents using a hash value mapped to a word mnemonic for easy recall and comparison. A hash algorithm may be applied a document to generate a distinguishing hash value. The hash value is mapped to a plurality of words to form the mnemonic. To obtain the words, the hash value may be mapped to word indices used to identify particular words in word lists. Word lists may include a list of nouns, a list of verbs, and a list of adverbs or adjectives, so that the resulting three word mnemonics are memorable. More word lists may be used to map hash values to four-, five- or more word mnemonics. The number-to-mnemonic mapping methods may be used to map large numbers, such as account numbers, telephone numbers, etc. into mnemonics which are easier for people to remember and compare.

Abstract: Provides is an apparatus for question answering based on answer trustworthiness including: an answer indexer that indexes documents of which document trustworthiness satisfying a threshold value among documents included in a document collection and stores it in a knowledge Bases; an answer candidate extractor that extracts answer candidate documents for a user's question from the knowledge Bases; an answer source trustworthiness measurement unit; an answer extraction strategy trustworthiness measurement unit; and a trustworthiness integrator that generates an answer candidate trustworthiness list by ranking the answer candidate documents on the basis of the document trustworthiness, the source trustworthiness, and the extraction strategy trustworthiness of the answer candidate documents.

Abstract: An automatic keyword analysis for content illumination and document fragmentation for internet search queries. Initially, the invention obtains keywords from a document. The taxonomy then expands the obtained words from the document. The keywords are further refined using keyword demand data. The keyword demand data includes words where too few or too many searches would hamper the user's search. After refinement, the keyword final set is placed onto the appropriate web page. Consequently, internet search engines “hit” the web page because the automatic keyword analysis added optimal and efficient keywords.

Abstract: A search engine database may a segmented structure that preserves individual document references and allows updating as well as scalability. A set of segment managers may receive new, updated, or deleted documents and update a set of term matrices from which a published search matrix may be generated. The database may have a very large term dictionary and may use a hash function to create term identifiers without having to look up terms in the dictionary. The database may be maintained by many systems operating in parallel for high scalability.

Abstract: The objective of the present invention is to manage reference movies using an index file, without causing the user to be perplexed. the reference movies are generated because of, for instance, the upper limit of the file size. The index file manages sets of information regarding the files being managed. Examples of these sets of information are information for determining whether or not a file is presented to the user, information for determining whether or not a file is original, and information indicating whether or not nondestructive editing has been done. Based on such information, the erasure, displaying a list, and so on are carried out. Thus, it is possible to manage the reference movies using the index file, without causing the user to be perplexed.

Abstract: According to one aspect of the invention, in response to one or more terms to be indexed, each of the terms is indexed in a regular index. In addition, for each of the terms having multiple characters, at least one prefix portion of the term is indexed in a prefix index, where the regular index is used for regular searches and the prefix index is used for prefix searches without having to combine a plurality of postings lists of the regular index at the point in time.

Abstract: A client generates an index token for each of a plurality of data objects received from a server as a function of at least one of the plurality of fields of the data object. The client creates an index for the plurality of data objects based on the generated index token for each data object. The client may then utilize the index to search plurality of data objects to identify and render a subset of the data objects.