Abstract: An illustrative cloud-based air-gapped data storage management (destination) system obtains authorized access to other (source) systems' backup copies, replicates those copies within the destination system, parses supplemental metadata included in the source backup copies, and integrates the replica copies into the destination system as though natively created there. Replica copies are integrated as backup copies without first restoring the source backup copies to a native data format. The source system lacks knowledge of or connectivity with the destination system, thus maintaining an “air gap” between the systems. The destination system preferably operates in a cloud computing environment. The destination system uses supplemental metadata from the replica copies to re-create or mimic the source's computing environment and to restore backed up data from the replica copies.

Abstract: A method for generating documentation text comprises: extracting, from a plurality of source files of a software program, a plurality of element identifiers, each identifying an element of the software program; selecting a set of selected element identifiers of the plurality of element identifiers according to a plurality of scores, each score computed for an element identifier of the plurality of element identifiers; and for each of the set of selected element identifiers: generating an element documentation text using a documentation template and a plurality of patterns identified in a plurality of usage instances where in each of the plurality of usage instances the selected element identifier exists in at least one of the plurality of source files; and adding the element documentation text to a repository of documentation text associated with the plurality of source files.

Abstract: A method at an aggregator includes: storing previous search results resulting from previous client search requests, and for each previous search result, a previous handling indicator, indicating a relevance of the previous search result to the client; receiving, from the client, a search request containing search parameters; in response to the search request, selecting a subset of previous search results based on correspondence between attributes of the previous search results and the search parameters, and on the previous handling indicators; providing, to a supplier, the search request and auxiliary search parameters corresponding to the selected previous search results and indicating characteristics of the selected previous search results, for generation of current search results at the supplier employing the auxiliary search parameters as inputs; receiving, from the supplier, the current search results generated at the supplier; and returning at least one of the current search results to the client.

Abstract: The disclosure discloses a method and an apparatus for recognizing an entity word. The method includes: obtaining an entity word category and a document to be recognized; generating an entity word question based on the entity word category; segmenting the document to be recognized to generate a plurality of candidate sentences; inputting the entity word question and the plurality of candidate sentences into a question-answer model trained in advance to obtain an entity word recognizing result; and obtaining an entity word set corresponding to the entity word question based on the entity word recognizing result.

Abstract: Provided is a forensic index method by distributed processing, including: generating data to be divided by dividing data to be indexed according to predetermined division setting for distributed processing; allocating the generated data to be divided to a plurality of data processing units according to the predetermined division setting, extracting an index by filtering the allocated data to be divided in the plurality of data processing units, and generating divided index data including the extracted index; and generating an index database by merging the generated divided index data.

Abstract: A system that provides secure autocomplete searching receives an autocomplete query from a user, the autocomplete query including a prefix of a search phrase, and retrieves security information of the user. The system searches one or more prefix indexes to find a set of matching objects, where the matching objects each include associated object security information. The system excludes matching objects that the user is not authorized to access from the set of matching objects based on the object security information and the user security information. The system then returns the set of matching objects to the user.

Abstract: Systems and methods that allow for an intelligence platform for distributed processing of big data sets including both structured and unstructured data types across two or more intelligent data operation engine servers. The intelligent data operation engine servers can form a conceptual understanding of content in each electronic file and then cooperates with a distributed index handler to index the conceptual understanding of the electronic file. A query pipeline and the distributed index handler in the intelligence platform cooperate with the two or more intelligent data operation engine servers to improve scalability and performance on the big data sets containing both structured and un-structured electronic files represented in the common index.

Abstract: Methods and systems are described for identifying a matched tag set. In one aspect, a first resource is identified that is first tagged with a first tag associated with a first tagging criterion by a first matched tag and that is second tagged with the first tag associated with a second tagging criterion by a second matched tag. Selection information is received identifying the first tag. Based on the first tagging criterion, a first set is identified that includes at least one resource when the selection information identifies the first matched tag, wherein each resource in the first set is tagged with the first tag. Based on the second tagging criterion, a second resource, not included in the first set, is identified that is tagged with the first tag when the selection information identifies the second matched tag.

Abstract: A method of phonetically searching media information comprises receiving a plurality of search queries from one or more client systems and providing a phonetic representation of each search query. One or more search jobs are instantiated, each search job comprising a plurality of tasks, each task being arranged to sequentially read a block from an archive file. The archive file is stored within a distributed filing system (DFS) in which sequential blocks of data comprising the archive file are replicated to be locally available to one or more processors from a cluster of processors for executing the tasks. Each block stores index files corresponding to a plurality of source media files, each index file containing a phonetic stream corresponding to audio information for a given source media file. Each task obtains phonetic representations of outstanding search queries for a block and sequentially searches the block for each outstanding search query.

Abstract: A method for generating content links between a first digital file and a second digital file by detecting a content feature of a first digital file segment of the first digital file during playback of the first digital file segment of the first digital file, searching an index of a plurality of content features for a plurality of segments including a second digital file segment of the second digital file, and dynamically generating a link between the first digital file one segment of the first digital file and the second digital file segment of the second digital file when a content feature of the first digital file segment of the first digital file is related to the content feature of the at least one segment of the second digital file.

Abstract: A server receives a query specifying filter criteria from a client. The server obtains the object identifiers (IDs) for the data objects satisfying the query from one or more object identifier caches. The data objects are retrieved from one or more data sources using lookups based on object identifiers (IDs) obtained from the one or more object identifier (ID) caches. The retrieved data objects are returned to the client in response to the query.

Abstract: Method and apparatus for searching chronologically stored related content objects for at least one requested search definition. The method includes retrieving a search request identifying the related content objects to be searched and the at least one requested search definition to be applied to the related content objects and determining whether any new related content objects have been stored after the searching has begun. If any new related content objects have been stored, one of the new related content objects is selected for searching and, if no new related content objects have been stored, an older stored related content object is selected for searching. The method also includes applying the at least one requested search definition to the content object selected for searching, and identifying which at least one requested search definition is found in the selected content object.

Abstract: A computer-implemented method of storing data for fast lookup comprises forming a first and a second array of pointers, forming a record to store, the record comprising fields for, a first list pointer, a second list pointer, which is not the first field in the record, a first key, and a second key. The method further comprises determining a first index based at least in part the first key, setting the value of the pointer at the first index in the first array to the location of the first pointer field of the record, determining a second index based at least in part the second key, and setting the value of the pointer at the second index in the second array to the location of the second pointer field of the record.

Abstract: Embodiments of the present invention provide an approach for integrated development environment (IDE)-based repository searching (e.g., for library elements such as classes and/or functions) in a networked computing environment. In a typical embodiment, a first program code file is received from a first integrated development environment (IDE). The first program file may be associated with a set of attributes as stored in an annotation, header, or the like. Regardless, the first program file may be parsed and indexed into a repository based on the set of attributes. A search request may then be received from a second IDE. Based on the search request and the set of attributes, a matching program code file may then be identified as stored in the repository. Once identified, the matching program code file may be transmitted/communicated to the second IDE to fulfill the search request.

Abstract: Systems, methods and apparatus to monitor media presentations are disclosed. An example method includes identifying a media presentation device associated with a Domain Name Service (DNS) query based on a public Internet Protocol (IP) address that originated the DNS query and a destination address of the DNS query. A media source is identified based on a domain name requested in the DNS query. Identification of the media presented in association with the DNS query based on at least one of tagging data and metering data is attempted. A panelist associated with the media presentation device is credited with exposure to the identified media from the media source via the media presentation device when the media is identified. The panelist associated with the media presentation device is credited with exposure to media from the media source via the media presentation device when the media is not identified.

Abstract: The techniques discussed herein efficiently perform data-parallel computations on collections of data by implementing a differential dataflow model that performs computations on differences in the collections of data. The techniques discussed herein describe defined operators for use in a data-parallel program that performs the computations on the determined differences between the collections of data by creating a lattice and indexing the differences in the collection of data according to the lattice.

Abstract: A method includes identifying at least one document associated with content from at least one digital content source. The at least one document includes information identifying at least one aspect of the content. The method also includes determining a document index for the at least one document based on keywords included in the at least one document. An activity field is inserted into the document index. The method includes accessing activity information. The activity information identifies at least one activity keyword associated with at least one activity. The method further includes identifying at least one present activity keyword in the document based on the activity information. An indicator of at least one present activity is determined based on the at least one present activity keyword. The method includes indexing the indicator of the at least one present activity in the activity field of the document index.

Abstract: Techniques and tools are described for matching documents against monitors. An index can be generated from a plurality of monitors, where the index represents the query logic of the plurality of monitors. The index can be searched using the documents as search queries. The searching can comprise matching the documents against the monitors using the query logic represented in the index. An index can be distributed to a plurality of computing devices to be searched at the plurality of computing devices, where each computing device searches a subset of a plurality of documents against the full index. Searching at the plurality of computing devices can be performed in parallel, and results can be aggregated at a central location.

Abstract: An efficient manner of performing an M-out-of-N partial matching search of indexed documents (e.g., web pages) is provided herein. More particularly, indexed words are arranged into a global location space (GLS), providing for respective occurrences of words in indexed documents being searched to have continuous locations on a one-dimensional GLS. Documents within the GLS are separated by end of document word marking boundaries between consecutive documents. The query words are then separated into an active set, comprising the left-most query words, and a non-active set. A partial matching operator transverses the GLS, applying active geometric constraints, in a sequential manner, to words in the active set. This causes shifting of the active set along the GLS to comprise M left-most query words. If a document satisfies constraints associated with M words in an active set, the document comprises at least M-out-of-N words.

Abstract: A data format is optimized for storing data such as website traffic data. The data format enables easy access to and filtering of data, for example in generating website traffic reports. The data format also provides significant data compression. A method for generating a data file according to the data format employs linear compression and indexing to efficiently store the data. Data stored according to the format can be easily retrieved, particularly when a known value is specified and particular entries matching the known value are sought.

Abstract: Methods and systems using aggregated electrical system load profiles in determining additional load profiles, and determining consumption management system characteristics, features, and operating requirements at a site are disclosed, along with methods of generating and maintaining databases of load profile information and consumption management system requirements. By using some embodiments of the methods and systems described herein, it is faster and easier to design and implement effective consumption management systems, to determine problematic electrical systems at a site, and to diminish anomalous consumption patterns in an aggregate unprofiled electrical system load profile.

Abstract: A system and method for mapping text phrases to geographical locations is provided. Entities, each comprising one of a location, person, and place, are identified in one or more documents. Possible candidate locations associated with each entity are determined. An initial score is assigned to each location. The initial scores are adjusted and the candidate location with the highest adjusted score is selected for each entity. The selected candidate location is applied to all occurrences of the entity in the documents.

Abstract: Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.

Abstract: Techniques for generating and publishing searchable feeds for websites are provided. An indication is received of content of interest of a selected website. The selected website is crawled to retrieve a plurality of pages. The retrieved pages are processed according to the indicated content of interest to generate structured content. The structured content is indexed to generate an index. A query interface is provided that receives queries directed to the index, applies the received queries to the index, and transmits responses to the received queries.

Abstract: There is described a method and system for obtaining ranked search results including names of experts who are members of a social network and presenting the ranked search results to a user performing a search from a user interface of a user device. The user is registered on the social network and has connections thereon. The method comprises: indexing data representative of activities of the members on the social network to produce indexed activity data; receiving a search query relative to a subject along with a user identifier from the user device; using the search query and the user identifier, ranking members from the user's connections based on their activities on the social network related to the subject to obtain ranked experts for the subject; returning the names of ranked experts for the subject to the user device for presentation on the user interface.

Abstract: Techniques for providing contextually-relevant content include identifying content items accessed through a portal by a plurality of users, each user associated with one or more roles of a plurality of roles within the portal; updating a trace log to include information associated with the identified content, the information including associations between each identified content item and the role accessing each identified content item; receiving, from a user associated with a particular role of the plurality of roles, a search query through the portal for one or more content items; determining a plurality of search results responsive to the search query, the search results relating to the content items; for the particular role, filtering the plurality of search results based on the trace log; and generating a plurality of filtered search results for presentation through the portal.

Abstract: Described herein are various technologies pertaining to provision of query suggestions to a user independent of a query log. Key phrases are automatically identified in documents of a document corpus, and a forward index and inverted index are generated. The forward index indexes key phrases by documents, and the inverted index indexes documents by key phrases. A query is received from a user, and documents relevant to the query are retrieved. Key phrases in the retrieved documents are identified via the forward index, and a subset of the key phrases are selected as query suggestions by determining coverage of the key phrases as identified in the inverted index.

Abstract: Providing for search to facilitate discovery or access to configuration functions of a computer application is described herein. By way of example, metadata can be appended to configuration functions of the computer application. A matrix correlating subsets of metadata with related configuration functions can facilitate distinguishing respective configuration functions, or groups of related configuration functions based on the subsets of metadata. User search data can be referenced against the subsets of metadata. Respective subsets of metadata that satisfy a condition defined by a data matching function can be returned as a match, and configuration functions associated with matching metadata can be output in response to the search data.

Abstract: An apparatus and method for quickly searching and ranking related documents in a database, and an interactive window that allows a user to dynamically reselect a priority of a score among a plurality of scores for re-ranking documents. In operation, the search engine 102 receives a query comprising a plurality of keywords from the user 100 via a user interface 101, performs a binary search on the sorted database 103 to quickly produce a list of files-of-interest. The ranking engine 104 uses the list of files-of-interest to search corresponding files in the list from the original database 105, score corresponding files to obtain the plurality of scores based on a plurality of paragraph scores for ranking files, where each paragraph score is calculated based on a number of matched query-keywords, frequency of occurrences and proximity distances between matched keywords within each paragraph.

Abstract: Provided is a forensic index method by distributed processing, including: generating data to be divided by dividing data to be indexed according to predetermined division setting for distributed processing; allocating the generated data to be divided to a plurality of data processing units according to the predetermined division setting, extracting an index by filtering the allocated data to be divided in the plurality of data processing units, and generating divided index data including the extracted index; and generating an index database by merging the generated divided index data.

Abstract: Methods and apparatus for searching a message store on a portable device are described herein. The methods allow a plurality of possible search criteria to be generated and displayed. One or more of the possible search criteria may be selected and added to a search string that is used to search the message store.

Abstract: System and method permit prior art management. A method may comprise maintaining a database of patent portfolios and a database of patents with each patent stored in the database of patents associated with one or more patent portfolios stored in the database of patent portfolios. A method and system of prior art management may include maintaining a database of prior art portfolios, a database of patent matters, and a database of prior art reference citations, at least some of the prior art reference citations being associated with at least one of the patent matters stored in the database. Prior art references may be cross-cited between patent matters and portfolios.

Abstract: In response to a search query having a search term received from a client, a current language locale is determined. A state machine is built based on the current language locale, where the state machine includes one or more nodes to represent variance of the search term having identical meaning of the search term. Each node of the state machine is traversed to identify one or more postings lists of an inverted index corresponding to each node of the state machine. One or more item identifiers obtained from the one or more postings list are returned to the client, where the item identifiers identify one or more files that contain the variance of the search term represented by the state machine.

Abstract: Systems, methods, and computer-readable and executable instructions are provided for recommending print locations. Recommending print locations can include receiving recommendation, user, and geographic information for a first mobile print location (MPL) and a second MPL. Recommending print locations can also include indexing the recommendation, user, and geographic information for each of the first MPL and the second MPL as an automatically created uniform resource indicator (URI) on an MPL system. Furthermore, recommending print locations can include ranking the first MPL and the second MPL based on the recommendation, user, and geographic information and presenting a list, via a user interface, of the ranked first MPL and the second MPL.

Abstract: A mechanism is provided for facilitating object search in a virtual world environment where each object is defined by a plurality of attributes and the search is performed on any attributes of the object however is not limited to a 3-D search. The co-ordinate location of each object in the virtual world is also provided in the search result and the range within which to perform the search may also be specified. Optionally, the user has the ability to teleport/transport to the location of the object using the search result.

Abstract: One aspect of the invention provides an indexing system of space of interest (SOI) defining at least a two-dimensional object. The system includes: a location data extractor configured calculate an index point for the space of interest; a map tile number converter configured to map the index point to a tile that lies within a plurality of tiles; and an indexer configured to index the space of interest based on the determined tile.

Abstract: Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is organized into discrete events with normalized time stamps and the events are indexed by time and keyword. A search is received and relevant event information is retrieved based in whole or in part on the time indexing mechanism, keyword indexing mechanism, or statistical indices calculated at the time of the search.

Abstract: An apparatus to process partitioned data includes a storage unit to store a first data portion of a data file; a communication unit to receive a second data portion of the data file from a device in response to an authentication between the apparatus and the device; and a recovery processing unit to obtain the data file, by merging the first data portion and the second data portion of the data file using partition information.

Abstract: The present invention relates to a system and method for assessing application performance and user satisfaction. In one embodiment, the system and method calculates an Operational Index (OPdex) representing user satisfaction with an application. The OPdex may be a number quantifying user satisfaction with an application, such as a web application, and system performance. The OPdex may be based on one or more measurable metrics having a range of values that may affect user satisfaction or performance of an application. The OPdex may comprise calculating the index based on a soft threshold, a hard threshold, and measurements indicating a perceived application response time. The OPdex calculation may also account for sensitivity of user satisfaction to response time. Based on the OPdex, the system and methods also provide information indicating the relationship among application response time thresholds set by the users, the user satisfaction level, and the mean response time.

Abstract: Provided are techniques for processing a query. A query including constraints for at least two vertically partitioned, inverted indexes is received. The constraints in the query are separated based on the vertically partitioned, inverted indexes. A document identifier iterator is obtained for each of the constraints, wherein each document identifier iterator is associated with a posting list, and wherein each posting list is ordered by document identifier order. A run-time join of the posting lists is performed to obtain a final result set.

Abstract: Provided are techniques for processing a query. A query including constraints for at least two vertically partitioned, inverted indexes is received. The constraints in the query are separated based on the vertically partitioned, inverted indexes. A document identifier iterator is obtained for each of the constraints, wherein each document identifier iterator is associated with a posting list, and wherein each posting list is ordered by document identifier order. A run-time join of the posting lists is performed to obtain a final result set.

Abstract: A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query, identifying a plurality of candidate answers to the query; and for at least one of these candidate answers, identifying at least one proof of the answer. This proof includes a series of premises, and a multitude of documents are identified that include references to the premises. A set of these documents is selected that include references to all of the premises. This set of documents is used to generate one or more scores for the one of the candidate answers. A defined procedure is applied to the candidate answers to determine a ranking for the answers, and this includes using the one or more scores for the at least one of the candidate answers in the defined procedure to determine the ranking for this one candidate answer.

Abstract: A search query including search criteria can be received. The search criteria can be a text string. An enhanced search against an enhanced index can be executed. The enhanced index can be metadata associated with an enhanced cluster. The enhanced cluster can be a document cluster associated with the metadata. The enhanced cluster can be aggregated into a merged document. The merged document can be a document including the enhanced cluster contents. The ranking algorithm can be executed on the merged document to obtain a final ranking of content within the single document.

Abstract: According to one embodiment, an information processing apparatus includes a storage, a log receiver and a merge module. The storage stores a plurality of log data, and first index data corresponding to the plurality of log data. The log receiver receives first log data and second index data from a client apparatus connected via a network, the second index data corresponding to the first log data. The merge module generates third index data by merging the first index data and the second index data. The storage stores the plurality of log data, the first log data and the third index data.

Abstract: A tool for generating at least one search index for a composite document, wherein the composite document comprises multiple component documents. The search index is generated by extracting characters from the document, segregating the characters into tokens of one or more characters, and determining location information of the tokens. The location information can include the page number of the component document and X, Y page coordinates for the tokens. The tool also provides a user interface that allows for searching of the composite document using at least one of the generated indexes. The user interface allows the user to enter one or more search terms and to select the criteria that will be used during the search. Results are presented to the user via a list of document names that are also hyperlinks to the document. The results documents are listed in order of relevancy, and fragments of text that contain the searched terms are also available to the user, for each document.

Abstract: Various arrangements for using a k-dimensional tree for a search are presented. A plurality of descriptors may be stored. Each of the plurality of descriptors stored is linked with a first number of stored dimensions. The search may be performed using the k-dimensional tree for one or more query descriptors that at least approximately match one or more of the plurality of descriptors linked with the first number of stored dimensions. The k-dimensional tree may be built using the plurality of descriptors wherein each of the plurality of descriptors is linked with a second number of dimensions when the k-dimensional tree is built. The second number of dimensions may be a greater number of dimensions than the first number of stored dimensions.

Abstract: Embodiments of the invention relate to building a distributed reverse semantic index. In one general embodiment a plurality of documents are received with each document having at least one defined rule and or semantic. The documents are distributed among a plurality of nodes of a system. The documents are processed in a generally parallel fashion. Processing the documents includes processing text data of each of the document and breaking each document into fields to index the text data to create index data by deferring how to categorize the text data based upon the defined rule and or semantics. The indexed data is combined back together to create an indexer-agnostic semantic index including a plurality of the semantic index shards and to semantically classify the documents based on the index shards into groups based on document type to create the distributed reverse semantic index.

Abstract: A system for adding security data to a search index comprises a processor and a memory. The processor is configured to select an object in a search index, wherein an entry associated with the object is stored in the search index and add security entity data to an entry of the search index corresponding to the selected object. A memory is coupled to the processor and is configured to provide the processor with instructions.

Abstract: Method, system, and computer program product for faceted search with relationships between categories are provided. The method includes: having a document set of multiple documents, each document having associated categories to which it belongs; grouping multiple categories associated with a document into a category set based on a relationship between the multiple categories; associating the category set with the document; and indexing the category set for retrieval of documents from categories sharing a category set. Wherein indexing the category set includes: having an index entry of a textual representations of a category, wherein the index entry includes a single occurrence for each document to which the category is attached; adding a payload to a document occurrence of a serialization of an identifier of the category sets to which the category belongs associated with the document.

Abstract: The current subject matter relates to a technique for securing the content of one or more websites that crawls, scrapes, and indexes web-pages associated with websites. Once the content is secured, purchase transactions across heterogeneous vendor websites can be initiated in a unified manner. Related apparatus, systems, techniques and articles are also described.