52 results about "Indexed search" patented technology

A method and apparatus for indexing, searching, and retrieving data from data sets. Data sets may reside in the same database or be distributed across different databases. Data sets, whether within the same or distributed databases, may have the same format or heterogeneous formats. Source data sets are represented with mapping tables and inverted or index tables. Native fields of databases described in source tables are mapped to international or specialized standards. Source data fields that map to the standard field searched upon are identified, and objects satisfying a query's request are identified based upon the standard fields searched. Values are retrieved from the identified objects.

A query facility for database queries saves and re-uses query execution strategies, and automatically detects that a strategy should be re-optimized as a result of changes to an indexed variable value. Preferably, the number of records evaluated and selected by the index value condition is dynamically monitored during execution, and an alternative query strategy is initiated when this number appears to be out of proportion to expectations. In an exemplary embodiment, an indexed search strategy is changed to a table scan strategy (or vice versa) as a result of a change to the number of records eliminated by the indexed value, although other examples are possible. Preferably, the query engine initiates an alternative search strategy and concurrently continues to execute the original search strategy as separate threads. Search results are obtained from whichever thread completes first.

There are provided methods and systems for efficient search in a peer-to-peer network topology. In various embodiments, search methods and systems provide for response times and network traffic that are independent from the number of query terms, thereby producing constant run-time searches and bandwidth hits in a P2P network search implementation. By distributing inverse indexes between peers, and storing with each inverse index a Bloom filter populated with selected keywords, multi-term search and analysis can be conducted on one network node without requiring exchange of posting lists between various network nodes.

A searchable staging data store is provided, which stores new and updated records during a period of entry of those records to an enterprise-accessible data store and update of a search index with information from those records. The searchable data store provides rapid access to the data during that period of entry. Embodiments provide for searching a search index for records responsive to a search query, searching the searchable staging data store for records responsive to the search query, receiving search results from both the search of the search index and the searchable staging data store, and displaying those results.

A method and system searches documents that contain an ordered pair of keywords using search indices stored in multiple storage locations. In one embodiment, a server receives the search request that includes an ordered pair of keywords. The server hashes each keyword with multiple hash functions to obtain a hash vector pair, which are used to index a chain of search indices. Hash values in the hash vector pair are used to locate the chain of search indices that are stored across multiple storage locations. The last search index in the chain provides identifiers of documents containing the ordered pair of keywords, with a distance between the keywords in the documents below a predetermined limit. The documents can be retrieved from document repositories using the identifiers.

A computer research tool for indexing, searching and displaying data is disclosed. Specifically, a computer research tool for performing computerized research of data including textual objects in a database or a network and for providing a user interface that significantly enhances data presentation is described. Textual objects and other data in a database or network is indexed by creating a numerical representation of the data. The indexing technique called proximity indexing generates a quick-reference of the relations, patterns and similarity found among the data in the database. Proximity indexing indexes the data by using statistical techniques and empirically developed algorithms.

A system for meta-indexing, search, compliance, and test framework for software development is provided, comprising an indexing service configured to create a dataset by processing and indexing source code of a project provided by a developer, perform a code audit on the indexed source code, store results from the code audit in the dataset, gather additional information relating to the provided project, store the additional information in the dataset, and store the dataset into memory; and a monitoring service configured to continuously monitor the project for at least source code changes and make changes to the dataset as needed.

A search algorithm utilizing confidence levels of keywords spoken by a caller to identify keyword indexed search items which best match the spoken keywords. In response to receiving a spoken search request from a caller, keywords are identified in the spoken search request. A list of candidates is created comprising a match to at least one of the keywords, wherein each candidate in the list is assigned a level of confidence in the match. Keyword indexed search items having at least one of the keywords as an index and an original matching score are then located. The original matching score of each keyword indexed search item is weighted with the level of confidence in the list of candidates to form weighted matching scores. The keyword indexed search items are sorted based on weighted matching score. A list of the sorted keyword indexed search items is then created.

A method and a computer system for indexing and searching the data content of nested field records, such as those in Extensible Markup Language (XML). The system includes an indexing and searching engine that constructs an improved full-text search index on the input XML data and then performs searches using the index. The system supports exact matches and partial matches using a wildcard character. The method transforms the input XML data into a form that encodes the data structural information by suffixing each word with its corresponding field qualifiers or an equivalent numerical pattern thereof. The resulting encoded words are then stored in a full-text index structure. Various types of full-index search may be performed. One alternative embodiment is to combine string matching and numeric or integer pattern matching to identify a particular word in a particular field. The portion of the word without field qualifiers is matched against the words in the index, and the pattern of numerals representing the word's field qualifiers is matched against the numeral patterns of the words in the index that correspond to their respective field qualifiers. Therefore, evaluation of complex field criteria is reduced to simpler and faster numeric matching.

There is disclosed a method and system for presenting indexed search results from a social network, concurrently with customary search results returned by a search engine hosted on a website, to a user performing a search from a user interface of a user device using the search engine. The user is registered on the social network and has connections thereon. The method comprises: indexing data related to users registered on the social network to produce indexed data, the data obtained from the social network hosted on a website different from the website hosting the search engine; receiving a search query along with a user identifier; performing a search on the indexed data specific to the user's connections to obtain indexed search results specific to the user's connections on the social network; and returning to the user device the indexed search results for presentation on the user interface.

A query facility for database queries saves and re-uses query execution strategies, and automatically detects that a strategy should be re-optimized as a result of changes to an indexed variable value. Preferably, the number of records evaluated and selected by the index value condition is dynamically monitored during execution, and an alternative query strategy is initiated when this number appears to be out of proportion to expectations. In an exemplary embodiment, an indexed search strategy is changed to a table scan strategy (or vice versa) as a result of a change to the number of records eliminated by the indexed value, although other examples are possible. Preferably, the query engine initiates an alternative search strategy and concurrently continues to execute the original search strategy as separate threads. Search results are obtained from whichever thread completes first.

The invention discloses a method supporting index creation in various modes. The method comprises the following concrete realization processes of configuring a unified index model, and deploying and installing a search engine server cluster; configuring database and index mapping; configuring HBASE and index mapping; configuring a structured document import script; configuring a non-structured document import script; creating a message queue, and creating indexes through the message queue in real time; searching data transmitted from an engine cluster pair, carrying out word segmentation and filtering treatment, and storing processing results in HDFS; and carrying out relevant retrieval according to input keywords. Compared with the prior art, the method supporting index creation in various modes has the advantages that the problem of unified retrieval of data from different sources and in different formats can be solved, the real-time data indexing capability is improved, the collecting and integrating capability on mass data is enhanced, the retrieval efficiency on the mass data is greatly improved, and the practicability is high.

Disclosed is a computer program stored in a computer readable storage medium according to an exemplary embodiment of the present disclosure. The computer program executes operations for enhancing search performance of data when the computer program is executed by one or more processors and the operations may include: setting a traverse time stamp of an index search for searching a target index key; searching the index tree along a link connected from a root node of the index tree to a leaf node; writing in a time stamp table at least one index time stamp of the root node and the leaf node passed in the index search; determining whether a path of the index search needs to be changed; and determining a start node of re-search at least partially based on the time stamp table.

The invention relates to an information search method and device based on a cloud technology, equipment and a storage medium, and relates to the technical field of information search. The method comprises the following steps of: receiving a target search request, forwarding the target search request to a corresponding target search engine; and according to the target index, instructing a target search engine to search the input information, and outputting a search result obtained by the target search engine, the target index being an index established according to the target context information, the search result being a choice content of the corresponding target index in the target data source, and the target data source being an unstructured cloud data source. As the target data source is the data source synchronous with the cloud, when the data source in the cloud database changes, the target search engine can synchronize the data source, automatic deployment of the target search engine is achieved when the cloud data source changes, and the retrieval efficiency and the result matching degree are improved by means of the target index.

An embodiment of the invention provides a device for searching indexes for sensor tag data. The can include a memory that has sensor tag data stored as a time series; an interface that is configured to receive tag names and time segment information for searching sensor tag data; and a processor that is configured to determine partitions of the memory having the sensor tag data stored therein based on the time segment information and configured to determine corresponding indexes and leaf nodes for the determined partitions based on the tag names and the time segment information. An embodiment of the invention can provide an optimized index structure for and a method of storing and searching time series sensor tag data with which most query patterns relating to time series sensor tag data can be satisfied.

Systems and methods are disclosed for generating functionality representation, indexing, searching, componentizing, an analyzing source code source code unit in a one or more of code repositories. The systems and method include one or more of crawling a set of data entities in a repository system; parsing said set of data entities into abstract syntax trees (ASTs) architecture; modeling said set of data entities into a code graph (CG) architecture; establishing type ontology (TO) architecture of said set of data entities; organizing and storing said set of data entities in functionality representation index (FRI) architecture; componentizing one or more projects in the repositories into code components; and making the components discoverable by functionality and analyzable for performance, usage volume, etc.

The present invention relates to a system and method of providing at least one digital content item substantially in real-time from at least one user's terminal to another user's terminal over a data network, said method comprises: (a) indexing at least one digital content item provided from at least one user's terminal over a data network, giving rise to an items index; (b) receiving a request to provide a digital content item to user's terminal over said data network; (c) conducting a search for the requested digital content item by means of said items index; and (d) if said requested digital content item is found within said items index, providing said requested digital content item from said at least one user's terminal to another user's terminal over said data network by streaming said digital content item substantially in real-time to said another user's terminal.

The invention provides a light application showing method combined with searching. The light application showing method is a solution for governments, enterprises and organizations to quickly and conveniently access interested applications and to realize instant-searching and instant-using without loading. Applications developed by developers are not isolated information islands any more, content in the applications can be all indexed, and all needs which are naturally expressed and related to applications to be searched during searching are guided to the applications developed by the developers, so that exposure quantity and using rate of the applications are increased greatly, and the distribution problem is solved at the source. Certainly, under which keywords a certain light application is displayed depends on what resources and services are provided specifically by the light application; the richer the resources and the services are, the better the needs of users are met and the higher the probability of being displayed is.

The present document describes a method for presenting modified information obtained from the internet on an application on a mobile device. The mobile device is set to communicate with the internet through a proxy server. A user of the mobile device is registered on a social network from which indexed search content specific to the user's connections on the social network are obtained. The method comprises: modifying, based on the indexed search content specific to the user's connections, an output for the application from an internet server to produce a modified output for the application; and sending the modified output for the application to the mobile device for presentation in the application on the mobile device.

A system and method for meta-indexing, search, compliance, and test framework for software development using smart contracts is provided, comprising an indexing service configured to create a dataset by processing and indexing source code of a project provided by a developer, perform a code audit on the indexed source code, store results from the code audit in the dataset, gather additional information relating to the provided project, store the additional information in the dataset, and store the dataset into memory; and a monitoring service configured to continuously monitor the project for at least source code changes and make changes to the dataset as needed. Additionally, a smart contract authority creates and enforces smart contracts for every transaction taking place upon the software essentially mandating and guaranteeing the security and authenticity of the software during the software's development and use.

A system and method for collecting, indexing, searching, accessing and downloading data over local and global computer networks. Data is reposed in a central database, indexed and interrelated by attributes characteristic of the data type. The data includes objects such as documents, queries, attribute lists and the like. The data is indexed and managed using a relational database management system (RDBMS). The central database and the RDBMS reside in a server that can be coupled to the global network through a network / user interface. Queries received by a user are converted to a format understood by the RDBMS. Objects can be returned as an image file for viewing, and can be purchased for downloading. Content to the database may be provided by individuals or proprietors of other databases, either on the network or through direct input to the server. Content to the database can also be self-generated by the RDBMS.

The invention provides a word segmentation method supporting a large number of word banks, and a computer readable storage medium and a system. The method comprises the following steps: constructing adomain dictionary; constructing an offline word segmentation model based on a domain dictionary; for the original text to be subjected to word segmentation, performing word segmentation through an offline word segmentation model to obtain a first word segmentation result; carrying out to-be-searched word extraction on the original text to be subjected to word segmentation, then carrying out first-level index search and second-level index search in the domain dictionary based on the to-be-searched words, and finally screening second-level index results to extract candidate words; and recombining the candidate words and the first word segmentation result, constructing a directed graph of the original text based on a recombining result, and calculating an optimal word segmentation result based on a shortest path method. According to the method, the word segmentation result in the single field is combined with the big word search result, the directed graph is constructed based on the combination result, the problem of solving the optimal word segmentation scheme is converted into the problem of the optimal path to be quickly solved, and the method is very suitable for segmenting the big words.

The invention discloses a search system and method and a storage medium, and the system comprises: a search platform which is used for determining a target search statement and a target index according to a search statement inputted by a user; the search engine that is used for querying a data index library corresponding to the target index according to the search term corresponding to the targetsearch statement, determining a data category corresponding to the search statement and sending the data category to the search platform; and the data platform that is used for obtaining a query template determined by the search platform according to the data category, searching a database according to the query template and determining a query result corresponding to the search statement, and thedatabase comprises a data index library. The problem that in a traditional method, when searching is conducted through a search engine, all data in a data platform need to be stored in the search engine, and consequently resources are wasted is solved. During data query, the search engine only stores part of data, resources are saved, and when the search engine performs data synchronization withthe data platform, time is saved, the workload is reduced, and the working efficiency is improved.

The invention discloses a data dynamic processing method based on distributed storage. A system architecture comprises an edge data acquisition layer, a data analysis layer and an interaction layer. The method comprises the steps of 1, responding to a search request; 2, splitting the search request; 3, processing a search request; 4, generating a data request; 5, carrying out data primary search;6, forwarding data; 7, analyzing indexes; 8, a search analysis engine processing the data; 9, summarizing fragmentation search analysis results; and 10, visually displaying the interaction layer. A method for generating a data request according to a fragmentation rule, creating a data forwarding instance to realize dynamic forwarding of data from an edge collection node to an analysis node and dynamically loading an analysis index engine is introduced in a data processing process, the difficulty that dynamic search can be supported and the barrier of data capacity caused by central storage canbe eliminated is solved, and a reliable data processing method is provided for big data analysis.

The invention provides an address library indexing method, an address matching method and related equipment, and the address library indexing method comprises the steps of dividing an address library into a plurality of query fragments according to at least partial region information of each piece of address information in the address library; performing an address index generation step on each piece of address information in the address library, the address index generation step comprising: performing word segmentation on the address information to obtain a plurality of word segmentation results; combining a plurality of word segmentation results of the address information to obtain a first field; and taking the first field as an address index of the address information so as to search and obtain the address information according to the address index. According to the invention, in an address base of massive standard addresses, under the condition that the accuracy is ensured, the optimal matching address can be found as little as possible.

A search algorithm utilizing confidence levels of keywords spoken by a caller to identify keyword indexed search items which best match the spoken keywords. In response to receiving a spoken search request from a caller, keywords are identified in the spoken search request. A list of candidates is created comprising a match to at least one of the keywords, wherein each candidate in the list is assigned a level of confidence in the match. Keyword indexed search items having at least one of the keywords as an index and an original matching score are then located. The original matching score of each keyword indexed search item is weighted with the level of confidence in the list of candidates to form weighted matching scores. The keyword indexed search items are sorted based on weighted matching score. A list of the sorted keyword indexed search items is then created.