Abstract: A search server system having one or more processors and memory receives a search query including filter criteria. The filter criteria specify operands and a logical relationship. In response to the search query the server identifies index portions sorted in a same sort order. The server identifies matching entities that match the search query by identifying index entries having a first identifier and matching filter(s) of a first operand and identifying, index entries having a second identifier that is sequentially adjacent to the first identifier in the sort order and matching filter(s) of a second operand. When index portion(s) associated with the first operand include index entries having a respective identifier between the first identifier and the second identifier and matching the filter(s) of the first operand, the server marks a respective entity associated with the respective identifier as matching the search query and sends search results to the client.

Abstract: Embodiments of the invention relate to organizing data records in a relational database. An aspect of the invention includes creating index items for a plurality of data records. Each index item includes a counter and the creating results in a plurality of counters. The numerical values of counters in corresponding index items are updated for data records in the plurality of data records that are subjected to random access. The plurality of data records are reorganized based upon the numerical values of the plurality of counters.

Abstract: In an item selecting apparatus performing a selection of an item to be recommended for each user, it is performed to calculate, with respect to each usage registration of an item by a user, an elapsed value as a difference between a time point of creating the item or staring providing of the item and a predetermined time point, acquire a usage characteristics of each user based on the elapsed value and calculate a freshness value representing a degree of freshness about each item. Further, using correspondence rules of different characteristics corresponding to the usage item on the correspondence rule corresponding to the usage characteristics of each user, calculate a priority of the item for each user, based on the novelty index and performing a selection of the item.

Abstract: A system logs life experiences using geographic cues. The system variously provides a comprehensive life-logging tool for recording a plurality of different types of life events. In one implementation, the system receives a user's GPS log files and multimedia content at a website. The system segments the GPS log files into geographic routes corresponding to user trips, and tags the multimedia content with geographic cues from the GPS log files. Then, the system indexes the geographic routes so that users can retrieve the geographic routes by browsing or by search techniques. The system displays animations of selected routes on a map, and displays the multimedia content at corresponding locations along the map route, as the route is replayed. The system also provides browsing and spatial and temporal techniques to search a person's travels and can provide graphical displays of the person's activity statistics.

Abstract: A conversation server system having one or more processors and memory stores a plurality of index components in an index. The server associates a first message having a first term with a conversation that includes at least a second message. The first term is not included in the second message and the second message includes a second term that is not included in the first message. The server stores, in the index, a plurality of index components for a same referenced object, including an index component indicative of the first term and an index component indicative of the second term. In some embodiments the same referenced object is associated with index components for a first sender of the first message and a second sender of the second message, so that a search for a conversation with messages from the first sender and the second sender retrieves the referenced object.

Abstract: A method of indexing a database column is disclosed. A permutation function f is determined. A shortcut that connects two non-adjacent elements of a permutation cycle based on f is created. A traversal of the permutation cycle without the shortcut comprises starting at a first element of the permutation cycle by updating a candidate row number to an initial value, wherein the initial value comprises a value stored in the database column. Traversing through one element of the permutation cycle comprises reading a row value in the database column using the candidate row number and then updating the candidate row number with function f of the most recently read row value. The step of traversing through one element of the permutation cycle is repeated until the most recently read row value is equal to the initial value. Creating the shortcut comprises storing a relation between the two non-adjacent elements.

Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

Abstract: A method of database indexing is disclosed. Two functions (f and g) from row values to row number values are set. The functions are utilized to determine a row number in a database column containing a target search value, wherein the target search value comprises a search value being sought in the database column. A candidate row number variable is set initially to the function g of the target search value by a processor. Iteratively the following is performed: a current value of the candidate row number variable is used as an address to read a value in a corresponding row in the database column, and the current value of the candidate row number variable is updated to the function f of the most recently read value in a corresponding row in the database column.

Abstract: Techniques for indexing multimedia data simultaneous with its capture to convert a real world event into an accessible database in real time are provided. The present invention introduces a new paradigm of converting a real world event in real time into a rich multimedia database by processing data from multiple cameras observing the event. Real time analysis of the camera data, coupled with domain knowledge, results in instant indexing of multimedia data at capture time itself. This yields the semantic information to answer complex queries about the content, and the ability to extract portions of data that correspond to complex actions performed in the real world.

Abstract: Evaluating content, comprising: setting threshold levels for desired categories of attributes which are to be used to evaluate the content, wherein the content has a set of attributes; comparing the set of attributes of the content to the threshold levels for desired categories; and allowing access to the content when the set of attributes of the content is within the threshold levels.

Abstract: The invention progressively indexes a database by building partial indexes over subsets of the data are built as the data is scanned, i.e., traversed, during execution of ad-hoc queries. Indexes are built as ad-hoc queries “touch” the data. This permits ad-hoc queries to utilize partial indexes built by other ad-hoc queries. If an ad-hoc query scans more data during execution than was previously indexed, the ad-hoc query will utilize the existing partial indexes to the extent they are relevant while adding to them or building additional partial indexes as the query executes.

Abstract: Static sorted index replication is described. A method may include receiving data to store in a memory tree of a replica in a partitioned distributed data store. The method may also include storing the received data in the respective memory tree of one of a plurality of replicas. The method may further include storing the received data sequentially in a static sorted index.

Abstract: Disclosed herein is a method and system for integrating an enterprise's structured and unstructured data to provide users and enterprise applications with efficient and intelligent access to that data. In accordance with exemplary embodiments, the generation of metadata indexes about unstructured data can be hardware-accelerated by processing streaming unstructured data through a reconfigurable logic device to generate the metadata about the unstructured data for the index.

Abstract: A method for analyzing and reporting gateway configurations and rules includes receiving configuration data from gateway devices providing access to an enterprise network. The gateway devices may be associated with multiple vendors. At least one computer processor parses the configuration information associated with each of the gateway devices to identify configuration output data for each of the gateway devices. The configuration output data for each of the gateway devices is stored in a single data structure. The configuration output data stored in the single data structure is indexed to generate one or more optimized data tables.

Abstract: One embodiment is a data processing apparatus that has a chunk store containing specimen data chunks, a manifest store containing a plurality of manifests, each of which represents at least a part of previously processed data and includes at least one reference to at least one of the specimen data chunks, and a sparse chunk index containing information on only some specimen data chunks. Input data is processed into a plurality of input data segments. Each manifest of the first set has at least one reference to one of said specimen data chunks that corresponds to one of the input data chunks of a first input data segment. Specimen data chunks corresponding to other input data chunks of the first input data segment are identified by using the identified first set of manifests and at least one manifest identified when processing previous data.

Abstract: A file system is disclosed that includes an application wide name space instantiated in a global index (Gindex) that is used for accessing objects related to an application. Using the Gindex, a method for cache coherency includes establishing one or more appliances, each defining a storage cluster; establishing one or more tenants spanning across appliances, wherein an application stores objects in file systems associated with the appliances and tenants; establishing a Gindex including metadata relating to objects stored in association with the application; replicating the Gindex to plurality of data centers supporting the tenants; storing an original object at a first data center; storing a cached copy of the object at a second data center; aligning the cached copy using metadata for the object from a local copy of the Gindex.

Abstract: A temporal database system, method, and computer-readable storage medium in which a database is provided with sets of entities defined by initial tuples having a set ID, a unique timestamp, and a member increment. A write transaction is performed for sets of entities, wherein the write transaction designates the set by said set ID and produces an increment, wherein the increment is a number of entities to be added to or removed from the designated respective set of entities. New tuples including the set ID, the increment, and a new unique timestamp are created for the write transaction. Following the write transaction, an asynchronous compaction operation is performed on the new tuples. The compaction operation aggregates the increment of each new tuple into summary point counts. The compaction operation facilitates efficient queries without contention with write transactions.

Abstract: A method, system and apparatus for a assigning keywords to a web page using keyword data from the web page itself, web pages having links pointing to the web page, and web pages pointed to by a link in the web page, wherein the keyword data from the multiple web pages is processed to provide a relevant set of keyword data for the web page.

Abstract: A system and method of content storage includes a content store for storing a plurality of first content blocks and one or more first indexes, a content manager including one or more first content analyzers, and an interface for receiving access requests for the plurality of first content blocks. Each of the one or more first indexes includes a plurality of first entries for organizing a plurality of second content blocks from the plurality of first content blocks according to a respective organizational structure. Each of the first entries includes a link to a corresponding content block from the plurality of second content blocks. Each of the plurality of content analyzers monitors the plurality of first content blocks for changes and updates a second index from the one or more first indexes based on information associated with the monitored changes.

Abstract: One or more techniques and/or systems are provided for maintaining user tagged content. For example, a user may experience content (e.g., watch a scene of a movie, create a photo, create a social network post, read an email, etc.), which the user may desire to save and/or organize for later retrieval. Accordingly, a personalization tag for the content may be received from the user (e.g., “Paris vacation photo”). The content may be indexed with the personalization tag within a personalization index (e.g., a cloud-based index for the user that may be accessible to any device associated with the user). In this way, the user may retrieve the content at a later point in time from any device. For example, a search query “Paris photos” may be received from the user. The personalization index may be queried using the search query to identify content that may be provided to the user.

Abstract: A system and method for targeting relevant research activity for clinical application in response to diagnostic markers analyses is described. Diagnostic analysis is performed to detect the level of each of at least three diagnostic markers. The levels of the tested markers are used to identify relevant publications from among a large database of articles. The most relevant literature, such as, one which reports research and studies that have been conducted to identify, moderate, and define the mechanisms unique to individual and combinations of diagnostic markers for various disease states, is then provided to the patient and/or the patient's physician, optionally with a summarization of the treatment recommendations from the provided literature. The customized information delivery provides a range of published peer-reviewed therapeutic options and/or published research studies.

Abstract: A system includes determination of a first tree comprising a first hierarchy of nodes and a second tree comprising a second hierarchy of nodes, determination of first subtrees of the first tree which are identical to first subtrees of the second tree, generation of a first mapping between nodes of the first subtrees of the first tree and nodes of the first subtrees of the second tree, generation of a first feature vector for each of second subtrees of the first tree, insertion of the first feature vectors into an index structure, generation of a second feature vector for each of second subtrees of the second tree, and generation of a second mapping between nodes of second subtrees of the first tree and nodes of the second subtrees of the second tree based on the second feature vectors and the index structure.

Abstract: A method of representing and managing hierarchical relationship configuration in a computing facility is described. The method includes providing and storing a first index of hardware identifier assigned to each object in the computing facility; providing and storing a second index of ancestry identifiers of each object in the computing facility, the ancestry identifier of an object being the hardware identifier of an ancestor object at 1 to n hierarchy levels above the object; providing and storing a type information element for each ancestor object indicative of a type of ancestor object; and identifying an ancestor object of a particular object in the computing facility by accessing the first index of hardware identifier of the particular object; and identifying an ancestor object thereof of a particular typed by accessing the ancestry identifiers and the type information element of the particular object.

Abstract: A method for processing geospatial datasets corresponding to geospatial objects, the method having the steps of extracting geospatial attributes from the geospatial datasets, locating extracted geospatial attributes corresponding to a particular geospatial object at a particular point in time, and generating output indicative of the particular geospatial object at the particular point in time utilizing the located geospatial attributes.

Abstract: The present technology is related to identifying, from within a corpus of documents, a subject (e.g., person, location, date, etc.) that is relevant to a topic and that is usable to enhance a topic-describing document. Documents within the corpus of documents share a link structure, such that some documents include hyperlinks that enable navigation to the topic-describing document, and the topic-describing document includes hyperlinks that enable navigation to other documents. Text of documents within the corpus is parsed to identify the subject, and a context of the subject suggests a degree of relevance of the subject to the topic. An enhancement type of the subject is determined, and a version of the topic-describing document is enhanced to include a presentation of the subject.

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: The present invention is a method for performing a multi-protocol scan of a NAS system by a storage virtualization system to create a multi-protocol file index. Current NAS systems may utilize two protocols, CIFS and NFS. Storage virtualization systems migrate, redirect or synchronize data between a primary and a secondary NAS. Present storage virtualization systems are designed to work with NFS or CIFS systems, but not both. The present invention enables a storage virtualization system to simultaneously or near-simultaneously operate using NFS and CIFS protocols. The present invention also provides for a multi-protocol scan of a NAS device to ensure that all data files and data file attributes are recognized and preserved during storage virtualization.

Abstract: Search may be performed on a user device, such as a handheld electronic book reader device. A search query term may be received. Text of a collection of electronic items stored in memory of the user device may be searched, using an item index and/or a master index, for the queried term. Search results may be returned identifying locations in the electronic items at which the queried term appears.

Abstract: An improved solution for managing structured data, and in particular generating compressed data based on the structured data. A schema that defines the structure of the data is used to generate a dictionary. The dictionary includes a set of dictionary entries, each configured to generate compressed data for a corresponding pattern defined by the schema. Additional compression can be implemented based on the structured data itself. The compressed data can be communicated between systems to reduce transmission time.

Abstract: Hierarchical temporal event management enables reduction or elimination of synchronization of multiple potentially huge indexes for real-time log indexing. Logs are time series data of events having associated times. Raw events are indexed in a hierarchical index. Transformed, filtered, or aggregated events are indexed in the hierarchical index at a different level of the hierarchy than the raw events. The result is a single hierarchical index that supports queries that optionally cross “level boundaries”, enabling a search on both aggregated information and specific elements. Such searches are usable when generating “drill down” data for graphs and reports. Search requests having corresponding search specifications are received from requestors. In response, a hierarchical event store is searched and results are provided to the requestors.

Abstract: Disclosed herein are systems, methods, and software for facilitating gallery environments and views. In at least one implementation an initial view is presented of tagged items arranged in tag groups. The tag groups correspond to tags and the tagged items are arranged in the tag groups based on with which of the tags each of the tagged items is associated. One of the groups may be identified for enhanced viewing. Accordingly, tagged items associated with the identified group, by way of their association with a tag corresponding to the group, are identified. In some implementations they may be referred to as enhanced tagged items. An enhanced view may then be presented of at least the enhanced tagged items.

Abstract: System and method for providing an automated method of importing NetCDF formatted data from a variety of sources that contain a variety of internal datasets. Options for processing and analysis can be provided and can occur simultaneously as the data are being processed. Storage and organization options provide efficient viewing and analysis of NetCDF datasets.

Abstract: In one embodiment, a method includes accessing a string of symbols by a computing device. The string is divided into one or more string components each including at least one of the symbols, and each string component is associated with at least one string-position identifier. The string components and their respective associated string-position identifiers are stored for the string of symbols.

Abstract: An example system for indexing heterogeneous resources includes a data module that invokes one or more APIs, and responsive to the invoked one or more APIs, receives a first set of attributes of one or more cloud resources of a first subset of the set of cloud resources and a second set of attributes of one or more cloud resources of a second subset of the set of cloud resources. The system also includes a normalization module that for at least one attribute of the first and second sets of attributes, searches a database for a normalized attribute corresponding to the respective one attribute, normalizes based on the uniform schema the respective attribute, and places the normalized attribute in a data structure. The system further includes an indexing module that indexes the normalized attributes in the data structure.

Abstract: Disclosed are a system and a method for analyzing a result of clustering massive data. An open-source map/reduce framework named Hadoop is used to calculate a silhouette coefficient corresponding to a significance verification index capable of evaluating a result of clustering massive data. To implement the system and the method for analyzing a result of clustering massive data, clustered data is divided into blocks. For all of the blocks, input splits are generated. Then, the generated input splits are assigned to multiple computers. Each computer stores only data of blocks included in an input split assigned in a memory, and calculates a silhouette coefficient for each record. Each computer provides only the calculated silhouette coefficient to an index coefficient calculation apparatus, and enables the index coefficient calculation apparatus to calculate a silhouette coefficient for a cluster. Therefore, the result of clustering the massive data can be rapidly and objectively analyzed.

Abstract: High performance index creation using parallel query plans with repartitioning scan and vector-based repartitioning scan is described. An example method includes extracting index key columns from data rows of the database table to build a set of index rows, wherein the index on the database table is defined by a plurality of index key columns including a first index key column and a second index key column. Partition boundary values are generated to divide up the index rows into range-partitioned sets, and the index rows are sorted based on values of the index key columns. A repartitioning scan, including a SARG-based or a vector-based partitioning scan is performed on the index rows, using a plurality of worker threads executing in parallel to build sub-indexes. Subsequently, each range-partitioned set of index rows are assigned to a worker thread in the plurality of worker threads. Accordingly, the sub-indexes generated from the plurality of work threads are merged to build the index for the database table.

Abstract: Event data comprising an unordered string set may be received. String set dictionary indexes may be assigned for strings of the unordered string set in a string set dictionary. The unordered string set may be sorted to provide a sorted series based on the string set dictionary indexes for the unordered string set. A differential series may be computed from the sorted series. The differential series may be encoded into binary code words. In an embodiment, the event data also may comprise strings. A schema version associated with the strings in a row may be determined. Computing resources may be allocated based on the schema version.

Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents. Phrases are extracted from the document collection. Documents are the indexed according to their included phrases, using phrase posting lists. The phrase posting lists are stored in an cluster of index servers. The phrase posting lists can be tiered into groups, and sharded into partitions. Phrases in a query are identified based on possible phrasifications. A query schedule based on the phrases is created from the phrases, and then optimized to reduce query processing and communication costs. The execution of the query schedule is managed to further reduce or eliminate query processing operations at various ones of the index servers.

Abstract: A first server is configured to receive one or more summarized data groups from a second server. Each summarized data group may include: information regarding a quantity of a group of records, where the group of records includes records associated with a record type and a time interval; information regarding a quantity of records associated with an indicator within the group of records; and information regarding a failure rate associated with the group of records based on the quantity of records associated with the group of records and the quantity of records associated with the indicator within the group of records. The first server is further configured to determine a threshold based on the summarized data groups and based on the failure rates associated with the summarized data groups and send an indication to the client device based on determining that the failure rate does not satisfy the threshold.

Abstract: An invention is disclosed for providing a digital resource gathering and dissemination system, method, or process that can accommodate digital resources of interest for heterogeneous groups and communities of online users for the same topic, demographic, or some other categories as provided by a particular classification scheme. Such a system, method, or process also provides a more reliable or otherwise representative selection of digital resources of interest to the population as a whole.

Abstract: Embodiments are directed to building an index structure for a relational database (RDB) table and for querying the RDB table. An aspect includes obtaining JSON documents from a RDB table, identifying JSON objects in the JSON documents and assigning identifiers for them, and building an index structure according to values in the JSON objects such that the index structure includes at least one node that records values in a JSON object and includes the identifier of the specific JSON object. Querying the RDB table includes receiving a query request including an indicator which indicates that the query is to be performed on JSON objects, and searching the index structure based on query conditions in the query request so as to determine a target JSON object that meets the query conditions.

Abstract: An extensive computer based online math research system (the “Research System”) having as its foundation an Ontology of mathematics, and utilizing unique and intensive computer support, coordination, data structuring, data storage, computer processing, retrieval capabilities, and data-mining capabilities, and an Ontology editing system that runs on computer software with computer processors and data storage capabilities (the “Ontology Editor System”). The Research System also includes a methodology to enable online reference and data manipulation of the Ontology, and an Internet based search of the concepts of mathematics and applications of mathematics to the sciences on the basis of the Ontology.

Abstract: Embodiments are directed towards employing an index of relevant items to determine and provide items that are relevant to a query. A data store that includes a plurality of items may be generated for each user. The user data store may be employed to generate an index of relevant items for each user. Relevant items may be pre-ranked in the index based on a degree of relevancy to a corresponding item. The index of relevant items may be employed to determine ranked relevant items associated with at least one item associated with a query. In response to the query, the relevant items may be further ranked or re-ranked based on at least a current time of the query and a time decay function associated the relevant items. A subset of the determined ranked relevant items may be provided to a client device for display to the user.

Abstract: Methods and apparatuses for asset management are disclosed. In one example, a system and method includes receiving an indication of a coupling of an asset to a computing device. An asset identifier stored on the asset is received and an asset data record corresponding to the asset is located. A data associated with the asset is recorded in the asset data record.

Abstract: A customized, topical database and methods for constructing and using such a database are provided. Selection and indexing of articles is done by experts in the topic with which the database is concerned. As a result, articles are indexed in a manner that allows facile, rapid retrieval of highly relevant articles with few or no false positives.

Abstract: A method includes identifying a target party of a social network based on at least one of a social affinity between an active user of the social network and the target party and a social network interaction history of the active user collecting content specific to the identified target party prior to receiving a request from the active user for content associated with the identified target party, and storing the content in a temporary storage. The method further includes receiving a request by the active user requesting particular content associated with the target party, the particular content among the collected content specific to the identified target party that is stored in the temporary storage. The method also includes providing the collected particular requested content from the temporary storage to the active user, at least in part based on the request by the active user for the particular content.

Abstract: Paging of data includes querying a table of data to determine an item identifier for each item in the table. An index table including an index identifier column of sequential integers and a corresponding item identifier column for each item in the table is generated and stored in a memory. A page index table including the item identifier that corresponds to a first index identifier and each item identifier that corresponds to one plus a pagesize multiple of the index identifier is generated and stored in a memory. A desired page of data is retrieved using the determined item identifier corresponding to the first item on the desired page and either the determined item identifier corresponding to the first item on a next page after the desired page or a determined item identifier corresponding to the last item on the desired page.

Abstract: A method of optimizing data recovery in an RDF data system in which the occurrence of data values across one or more of subject, predicate, and object are ranked, a handle is assigned to each of one or more of the ranked data values wherein the handle is directly based on the ranking. The rank-based handle can then be used to index the RDF statements. An RDF data recovery system includes an RDF statement processor configured to rank data values and assign handles to data values based on ranking.

Abstract: A system and a method for microcontent natural language processing are presented. The method comprising steps of receiving a microcontent message from a social networking server, tokenizing the microcontent message into one or more text tokens, detecting the language of the microcontent message and selecting the property dictionary for part-of-speech tag, part-of-speech tagging the microcontent message to identify related pronouns and nouns based on the selected dictionary, and extracting topics form the microcontent messages and assigning confidence values to the topics.

Abstract: A method for constructing an index suitable for indexing a large set of records identified by long generally randomly distributed record names and for answering membership queries about the set, the method comprising assigning each different record a different record name, determining that a new record name is not already represented in the index by checking an entry in a first level index that is shorter than the complete new record name, and determining that a queried record name is already represented in the index by determining that the queried record name is represented in a second level index that contains enough information to reconstruct the complete queried record name.