Abstract: Embodiments of the present invention are directed to identifying related data, in particular, data associated with different source types. In embodiments, a first source type related to a second source type associated with a search query is identified. Field set pairs are identified from a first data set associated with the first source type and a second data set associated with the second source type. Each field set pair can include one field set associated with the first source type and another field set associated with the second source type. For each field set pair, an extent of similarity is determined between the corresponding field sets. Based on the extent of similarities between the corresponding field sets, at least one pair of related field sets is identified. An indication of the at least one pair of related field sets is provided, for example, for presentation to a user.

Abstract: Fiducial markers are provided on patterned arrays of the type that may be used for molecular analysis, such as sequencing. The fiducials may have configurations and layouts that enhance their detection in image or detection data, that facilitate or improve processing, that provide encoding of useful information, and so forth. Examples of the fiducials may include offset layouts that may be useful in detecting the fiducials in different types and approaches in imaging, and that may help to distinguish regions of the array from one another in image data.

Abstract: A technique for logging tasks in a computer system. Tasks are logged into the computer system by executing at least one task at the computer system. A set of log metadata and a set of log levels of log records of the at least one task may be determined from an execution log output of the at least one task. Execution outputs of a further task may be determined according to the determined set of log metadata and associated set of log levels.

Abstract: A method is provided for batch processing data that is stored in multiple tables and is organized in the tables as a plurality of rows of data and a plurality of columns. Each row is identified by a key, and each column represents a field having a unique field name. The batch processing is performed using batch processing logic. In operation, the batch processing is performed by reading out data from only a portion of a row from each of the tables that is to be used for the batch processing logic by specifying the key of the row from the respective table, and the unique field names in the row of the respective table to be used for the batch processing logic. The remaining portion of the data in the row of the respective table is not read out from the row. Batch processing is then performed on the read out data using the batch processing logic. The batch processed data is then written back into the same row of the respective table that the data was read out from.

Abstract: A data processing method includes: obtaining a first subset and at least a second subset in a training dataset for learning, the first subset and the at least a second subset having a same size; determining a set of substrings based on data strings in the first subset and the at least a second subset, the substrings being suffix substrings of the data strings and being sorted in a lexicographical order; and determining a grain for deduplication of the training dataset from a set of longest common prefix (CLP) lengths of adjacent substrings in the set of substrings, for use in the deduplication. Thereby, different grains of duplicating procedures for different training datasets can be predicted automatically, and universality and flexibility of GPUaaS can be achieved. In addition, the deduplication rate can be improved, network resource waste can be reduced and system efficiency can be enhanced.

Abstract: Methods are provided of optimizing a tree-structured distributed-index with tree-nodes including data-elements and parent-child relations between tree-nodes. The distributed-index is stored in distributed system including computer-nodes each storing tree-nodes and a tree-map structurally describing the distributed-index. The methods include: inspecting the tree-map in first computer-node to determine whether the distributed-index is imbalanced due to a first tree-node in first computer-node and, in said case: notifying to other computer-nodes that first tree-node is replicable, to provoke that any request from other computer-nodes of inserting a data-element in first-tree-node includes inserting the data-element in corresponding child-node of first-tree-node; and verifying whether the other computer-nodes have been notified and, in said case, replicating data-elements stored in first tree-node into children-nodes thereof.

Abstract: Provided is a bot for a communication platform, wherein the bot is set up to read in an input data record, wherein the input data record includes a plurality of tickets or a plurality of numerical representations of tickets, listen in on at least one communication process between at least two persons on the communication platform, wherein the at least one communication process has at least one service case or at least one numerical representation of a service case, and generate an output data record, wherein the output data record has the input data record and the at least one communication process. A corresponding communication platform, a computer-implemented method, and a computer program product are also provided.

Abstract: The application discloses a semantic recognition method, an electronic device and a computer-readable medium, belongs to a field of intention recognition. The semantic recognition method includes the following steps: S1, constructing a morpheme database; S2, constructing a synonym database; S3, receiving a service session request of a customer, and creating a customer service session; S4, analyzing contents of the customer service session to obtain a word sequence which only contains the standard words for expressing the customer service session; S5, determining a missing morpheme in the word sequence which only contains the standard words, and asking the customer a question to obtain a completely expressed word sequence which only contains the standard words; S6, according to the completely expressed word sequence which only contains the standard words, finding out a matched answer from the morpheme database and sending the matched answer to the customer.

Abstract: A method of controlling polishing includes storing a library having a plurality of reference spectra, polishing a substrate, measuring a sequence of spectra of light from the substrate during polishing, for each measured spectrum of the sequence of spectra, finding a best matching reference spectrum using a matching technique other than sum of squared differences to generate a sequence of best matching reference spectra, and determining at least one of a polishing endpoint or an adjustment for a polishing rate based on the sequence of best matching reference spectra. Finding a best matching reference spectrum may include performing a cross-correlation of the measured spectrum with each of two or more of the plurality of reference spectra from the library and selecting a reference spectrum with the greatest correlation to the measured spectrum as a best matching reference spectrum.

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: Technologies related to multiple variable coverage memory for database indexing are generally described. Disclosed methods may be performed to implement high-speed database access to digital service provider customer data as the digital service provider builds an optimized index for a database. Initially, the digital service provider may maintain an appropriate level of service by keeping a relatively slow performing, basic index in a relatively high performance first memory. As the digital service provider builds the optimized index, the digital service provider may maintain the appropriate level of service by gradually shifting from use of the first memory to the use of a relatively lower performance second memory.

Abstract: A full-text search index for a table stored in a set of partitions of a database is refreshed. At a first point in time, table row distribution information and a table partitioning list are captured. At a second point in time, it is determined that an index refresh operation is to be performed. The captured table row distribution information is compared with current table row distribution information to determine whether there is at least one difference. In response to the determining that there is at least one difference, a text index distribution is re-aligned for any table rows that are affected by the change in table data row distribution by: generating a new table partitioning list, and indexing documents associated with table data rows that moved from one partition in the captured table partitioning list to another partition in the new table partitioning list.

Abstract: Indexing a data set of objects, where the data set is partitioned into plural work units with plural objects and distributed to multiple data process nodes. Each data processing node maps the plural objects in corresponding work units into respective ones of given sub-indexes. A composite index is constructed for the objects in the data set by reducing the mapped objects, where reducing the mapped objects is distributed among multiple data processing nodes.

Abstract: The system, method and machine-readable medium that provides an efficient presentation of a hierarchical table by providing an accurate summation of table line values when the table is expanded and collapsed.

Abstract: An article of manufacture having a plurality of sites in domains of regular patterns. Neighboring domains are oriented at different angles to improve the identification of the sites.

Abstract: Embodiments provide an approach for efficiently searching a temporal key index as well as enforcing key distinctiveness property in a database table corresponding to the index. For example, by addressing time range overlaps in an index having a sort order for temporal keys, a database management tool of a server system may efficiently process client requests while enforcing a temporal key property in the database table.

Abstract: Techniques and tools are described for augmenting search using association information. Searches can be performed using a combination of index information and association information. In some examples, index information is stored in a first data store and association information is stored in a second data store. Search queries can be received and modified using association information. Modified search queries can be executed using a combination of index information and association information. Index information can be generated by indexing a set of documents. Association information can be generated by monitoring user activity occurring between users and a set of documents.

Abstract: A method and apparatus for storing time series data, in which a data structure is defined comprising a plurality of consecutive slices, each slice corresponding to a time period, time series data is stored in the data structure as runs of time series data entries each having a fixed, predetermined size and being associated with a time, each run of time series data entries comprising a number of consecutive time series data values, wherein each run of time series data is stored in a slice corresponding to the time period of the times associated with the time series data entries of the run, and each run of time series data is associated with metadata identifying the duration of the run and an offset of a start time of the run from a start time of the slice in which the run is stored.

Abstract: Methods and systems for identifying one or more indexes are described. A system can collect a set of database operations that were performed during a given time window. Next, the system can partition the set of database operations based on a set of database tables that were accessed by the set of database operations. Then, for each database table in the set of database tables, the system can determine a set of indexes that are candidates for improving database system performance. Next, based on the candidate indexes, the system can identify one or more indexes, one or more combinations of indexes, and/or a consolidated index that improve overall database system performance.

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

Abstract: Methods for indexing data of an append-only, log-based structure include writing a plurality of data packets to a storage medium by sequentially appending the data packets to a log-based structure of the storage medium, the data packets associated with different logical identifiers belonging to a logical address space that is independent of physical storage locations on the storage media. The methods may further include writing an index segment associated with the plurality of data packets to the log-based structure, the index segment comprising index entries for determining the logical identifiers of the data packets and recording, on the storage media, information indicating where the index segment is written on the storage medium.

Abstract: Methods and systems are described for creating a custom index in a multi-tenant database environment. In one embodiment, a method includes obtaining query for a multi-tenant database that is recommended as a candidate for creating an additional filter, evaluating the query against criteria to determine whether to select the query for creating the additional filter, and creating the additional filter for the query, if the query is selected.

Abstract: An aspect includes phrase searching using exclusion tokens. A token division unit is configured to divide an input character string to be searched into a plurality of tokens. A token position definition unit is configured to set each token to be excluded in an occurrence position calculation as an exclusion token and to set each token to be included in the occurrence position calculation as a headword token, and define an occurrence position for each headword token. A position offset information assigning unit is configured to assign, to each of the exclusion tokens, position information obtained with the headword token followed by the exclusion tokens and to assign the headword token followed by the exclusion tokens as a starting point. An indexing processing unit is configured to perform indexing on the plurality tokens such that whether or not the exclusion tokens follow one of the plurality of tokens is identifiable.

Abstract: Methods and systems for providing an inverted index for a dataset are disclosed. The inverted index includes a position vector, with fields that correspond to values in the indexed dataset. The fields include data to be used in determining where each value appears in the dataset. The position vector is populated differently for different value types. A 1:1 value appears once in the dataset; a 1:n value appears multiple times. For a 1:1 value, the position vector stores information for where that value appears. For a 1:n value, the position vector stores a pointer, e.g. a memory reference, that identifies a list of locations where the value appears. The list can be encoded or otherwise compressed. A set of indicators can be stored for the fields indicating whether the field has 1:n or 1:1 value information. The indicator is used to control interpretation of the information in a field.

Abstract: Method, system, and programs for creating partitioned or fragmented log files during data logging to better manage file size, more easily facilitate data retrieval and file optimization. In an embodiment, typically large monolithic log files are fragmented or divided into smaller files that can be searched, stored, vacuumed and retrieved more easily.

Abstract: A dispersed storage network includes a dispersed storage device to store data. The dispersed storage device includes a processing module operable to slice a data segment of a data object into data slices. The processing module further creates a slice name for each of the data slices. The slice name includes routing information containing a vault identifier that identifies a vault associated with the data object, in which the vault identifies at least one user. The slice name further includes a source data name containing an identifier of the data object.

Abstract: There are provided methods and systems to identify an item based on data associated with the item. Information is received that is descriptive of an item to be listed on an information storage and retrieval platform. The information is associated with an aspect-value pair, which is an aspect of the item and a value of the aspect. An expression of an interest of a user in the item is received. The expression is associated with the aspect-value pair. In response to the associating of the expression with the aspect-value pair, the item is identified.

Abstract: A flow based detection system for detecting networks attacks on data networks. Flow records are collected in a novel data structure that facilitates efficient sorting. The sorted data structure can be subsequently analyzed in an efficient manner to find out if the network is under attack. An attack is identified if the numbers of unique corresponding addresses or conversations are too large.

Abstract: A database includes data tables and indexes that are partitioned. Searches against the data table are performed in parallel over the multiple partitions. The indexes on each partition maintain indexes associated with the data on the given partition. Data tables storing string data include a string data file and index files for each word stored in the string data file.

Abstract: An email server receives an email sent to an email account and including one or more attachments. The one or more attachments are extracted from the email into one or more temporary storage elements. Content from the temporary storage elements is indexed. The indexed content is stored along with an identifier of the email in an index corresponding to the email account. The one or more temporary storage elements is disposed of after the indexing.

Abstract: A system for providing content includes a source and a client. The source is capable of generating a representation of the content, the content being hierarchically-structured and including at least one item having an associated type. The source is capable of generating a representation including an identity table and at least one type table, each item of content being included in the identity table, and included in a type table based upon the type of the item. Thereafter, the source can be capable of providing the representation of the content. The client is capable of receiving the representation of the content, and accessing at least a portion of the content based upon the representation. The client can also be capable of receiving a query for at least one item of content, searching the representation for the item(s), and accessing at least a portion of the content including the item(s).

Abstract: The system, method and machine-readable medium that provides an efficient presentation of a hierarchical table by providing an accurate summation of table line values when the table is expanded and collapsed.

Abstract: A data management apparatus includes an index generation unit configured to subdivide an entire interval of data into bucket intervals, allocate indices for the respective bucket intervals, transform the bucket intervals having the allocated indices into bucket intervals of specific lengths, and generate bucket-based indices for pieces of data included in the bucket intervals of the specific lengths. The data management apparatus further includes a data management unit configured to transmit the encrypted data and the bucket-based indices to a server-side data management apparatus in order to store the encrypted data, transmit a user query to the server-side data management apparatus in order to search for a desired encrypted data, and decrypt encrypted data corresponding to the user query from the server-side data management apparatus. The user query includes the index of first bucket interval and the index of second bucket interval neighboring to the first bucket interval.

Abstract: Architecture that facilitates the ability to trigger the capture and storing of meeting state (or context) by way of a single user interaction (a “one-click” operation), referred to herein as a bookmark operation, and then to store and access the state for subsequent use. The state is captured relative to a point of reference, such as time, user, keywords, and reference to a document, for example. Thus, all state elements such as meeting activities, participants, and content (e.g., audio, video, images, text, documents, etc.). The bookmark assigned to the state at a particular reference can be selected to rehydrate all the state elements captured and associated with that bookmark (e.g., getting back to the point in the meeting to perceive a relevant portion of a document, part of the meeting video, or other recorded feed), as well as all other allowed state elements.

Abstract: According to some embodiments, audio information may be received at a speech recognition engine. The speech recognition engine may then automatically create: (i) a text transcript representing the audio information, and (ii) meta-data associated with the audio information, the meta-data including a term index. A semantic analysis may then be automatically performed for the audio information, and the semantic analysis may be based, for example, at least in part on a terminology repository and at least one of the text transcript or the meta-data. A result of the semantic analysis may be stored in a semantic index in relation to a record of the audio information.

Abstract: A system for extending a Time Intelligence language to provide support for period-to-date functions and for generating member sets in response to data queries is provided. The system may apply member aggregation functions and queries across a plurality of heterogeneous data sources. Each data source is aligned to a reference dimension and is said to organize data according to at least one level of granularity. In some embodiments, a member aggregation function specifies a period (e.g., year, quarter, month) and retrieves data from a data source starting with the current specified period and ending with the most recently completed period equal to the granularity of the data source. The system may allow a user to further customize a member aggregation function by specifying a granularity, a period offset, or a granularity end offset. Additionally, the system may generate a caption to display in association with the retrieved data.

Abstract: Method and system to search for data objects are provided. The method comprises generating an attribute index and a content index. The attribute index comprises entries associated with respective access control information for a set of data objects and generating. The content index comprises words from the set of data objects. A search query directed at the set of data objects is processed by searching the content index, searching the attribute index, and obtaining a search result based on the results of searching of the content index and the attribute index.

Abstract: A method and system for identifying a candidate subset of a data set comprises comparing suffixes of query field values to data field values of records in the data set. Sufficiently similar records are included in the candidate subset. Query field value suffixes may range in length from the query field value itself down to a minimum suffix length. The longest suffix may be processed first, and then successively shorter suffixes may be processed until a satisfactory number of candidates are identified. Entries in an index data structure derived from the data set may associate various suffixes found in the data set with individual records. The data structure entries may include record keys identifying records with data field values identical to the suffix and may also include suffix pointers identifying related data structure entries with suffixes similar to the entry's suffix.

Abstract: A method and system for indexing, searching, and retrieving information from timed media files based upon relevance intervals. The method and system for indexing, searching, and retrieving this information is based upon relevance intervals so that a portion of a timed media file is returned, which is selected specifically to be relevant to the given information representations, thereby eliminating the need for a manual determination of the relevance and avoiding missing relevant portions.

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 information processing apparatus includes a point database of position information and address information (text data of an address without a predetermined area name) for a point and with which a point search process is executed; a map database that includes text data of an area name for map display and with which a map display process is executed; and a control unit that, when a process is executed that uses text data of an address of a search point retrieved by the point search process, acquires from the point database, the position information and address information of the search point, acquires based on the position information of the search point and from the map database, the text data of the area name in the address of the search point, combines the acquired address information and acquired text data, generating the text data of the address of the search point.

Abstract: A method of searching a plurality of data files, wherein each data file includes a plurality of features. The method: determines a plurality of feature groups, wherein each feature group includes n features and n is an integer of 2 or more; expresses each data file as a file vector, wherein each component of the vector indicates the frequency of a feature group within the data file, wherein the n features which constitute a feature group do not have to be located adjacent to one another; expresses a search query using the feature groups as a vector; and searches the plurality of data files by comparing the search query expressed as a vector with the file vectors.

Abstract: A method of controlling polishing includes storing a library having a plurality of reference spectra, polishing a substrate, measuring a sequence of spectra of light from the substrate during polishing, for each measured spectrum of the sequence of spectra, finding a best matching reference spectrum using a matching technique other than sum of squared differences to generate a sequence of best matching reference spectra, and determining at least one of a polishing endpoint or an adjustment for a polishing rate based on the sequence of best matching reference spectra. Finding a best matching reference spectrum may include performing a cross-correlation of the measured spectrum with each of two or more of the plurality of reference spectra from the library and selecting a reference spectrum with the greatest correlation to the measured spectrum as a best matching reference spectrum.

Abstract: In an embodiment, a first plurality of rows of a first table are read from memory in an order of page addresses of pages in the memory that comprise the first plurality of rows. First selected rows from the first plurality of rows that meet a query predicate are stored into a result set. After the reading the first plurality of rows in the order of the page addresses, a second plurality of rows of the first table are read from secondary storage, in an order of row identifiers of the second plurality of the rows in the first table. Second selected rows from the second plurality of rows that meet the query predicate are stored into the result set.

Abstract: A system for real-time document indexing is provided that includes a browser that is executing on a client system. The browser includes functionalities allowing it to communicate with a remote computer system. A query interface executes within the framework of the browser. The query interface receives one or more query searches from an end-user and sends the one or more query searches to be processed by the remote computer system. The remote computer system sends to the query interface the results of the one or more query searches via the browser. The query interface assigns the results of the one or more query searches to a folder where the folder includes a unique identifier. The query interface indexes the results of the one or more query searches to the unique identifier of the folder.

Abstract: This method of updating an inverted index from at least one electronic document in which each electronic document is constituted by at least one ordered set of objects comprises, for each of said objects: a step of identifying a descriptor of said object, the descriptor being represented in the form of a tree; a step of determining a terminal leaf of said tree; and a step for updating a packet of information pointed to by said leaf, said packet of information including at least the list of said documents including said object.

Abstract: Techniques for searching a hierarchical database and an unstructured database with a single search query are described herein.

Abstract: A knowledge management platform eliminates the trial and error process for analytical chemists in, for example, identifying appropriate methodologies for separating mixtures of chemical compounds. The platform allows the analytical chemists to perform a variety of searches on data existing from previous experiments, procedures, and/or processes. The platform may be employed to make faster decisions, and ultimately decreases the time taken in selecting an appropriate separation methodology.

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

Abstract: In order to improve interactive compression using compression state information, the side information caches of communicating parties must be updated, or synchronized. The present invention is directed to a method of synchronizing side information databases within an interactive compression system comprising two communicating parties comprising the steps of transmitting, from the a first communicating party to the second communicating party, a device hierarchical node index; comparing the device hierarchical node index with a server hierarchical node index and then determining a shared hierarchical node index based on common entries in the two hierarchical node indexes.