Abstract: The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.

Abstract: Sparse data may be stored in a search index such that one or more data points related to a number of entities may be queriable. Upon detection of a data point related to an entity, an integer array may be created for the data point to store within a single column of the search index, the integer array including an identifier of the entity and a value associated with the data point. In response to receiving a request from a user to perform a query on the search index that includes the data point, the query may be transformed to a corresponding range based on the identifier of the entity. Upon execution of the query, the identifier may be removed and query results may be provided to the user as another array with a user-compatible identifier for the entity such that the results may be understood by the user.

Abstract: Techniques are provided for a fully-automated process for tuning database query language statements that selects database query language statements for tuning, tunes the database query language statements and generates tuning recommendations, tests the tuning recommendations, and determines whether to implement the tuning recommendations based on the test results. The fully-automated tuning process may also automatically implement certain tuning recommendations and monitor the performance of the database query language statements for which tuning recommendations have been implemented.

Abstract: Systems and methods for searching a document corpus and generating search queries are disclosed. A method includes providing for display a graphical user interface having two or more sections, and providing for generation of an initial search query based on locations of query terms entered into the graphical user interface. Sections of the graphical user interface indicate a query status. A revised search query based on a location of the query terms within the graphical user interface is generated following the manipulation of one or more of the query terms. Movement of a selected query term from a first section to a second section of the graphical user interface changes the query status of the selected query term from a first query status to a second query status. A search of the database is performed using the revised search query to return an updated set of electronic documents for display.

Abstract: Embodiments of the present invention relate to a declarative framework for efficient incremental information integration. In one embodiment, a method of and computer program product for information integration is provided. An integration rule is received. A first data set is accessed. A first representation of the first data is generated set based on the plurality of integration rules. The first representation is flat and includes a plurality of records. At least one index is generated. The index encodes at least one hierarchical relationship among the plurality of records. A second representation is generated of the first representation based on the at least one index. The second representation comprising nested data.

Abstract: Shareable links can be created to share content items and information pertaining to activity on those shareable links can be monitored and stored in an online content management service. Based on this activity information, predetermined actions can be executed. These actions can include sending notifications regarding link activity, disabling shareable links, and/or updating sharing limitations related to the shareable links. Using the activity information, popular shared content items can be identified and recommendations for sharing unshared content items can be provided to the user. Additionally, advertisements can be tailored to the relative popularity of the shared content items.

Abstract: A data analysis system stores in-memory representation of a distributed data structure across a plurality of processors of a parallel or distributed system. Client applications interact with the in-memory distributed data structure to process queries using the in-memory distributed data structure and to modify the in-memory distributed data structure. The data analysis system creates uniform resource identifier (URI) to identify each in-memory distributed data structure. The URI can be communicated from one client application to another application using communication mechanisms outside the data analysis system, for example, by email, thereby allowing other client devices to interact with a particular in-memory distributed data structure. The in-memory distributed data structure can be a machine learning model that is trained by one client device and executed by another client device. A client application can interact with the in-memory distributed data structure using different programming languages.

Abstract: In one example of a method to access data, selected data stored in a virtual tape library (“VTL”) maintained in a selected format in a first non-tape storage medium is examined. One or more first directories and one more first files are identified within the selected data. One or more second directories, and one or more second files, comprising information identifying at least one of the one or more first files, are generated and are stored in a second non-tape storage medium. A request specifying at least one of the one or more second files is received from a device, and information identifying at least one of the one or more first files is retrieved from the specified second file. The at least one first file is accessed based at least in part on the information, and data from the at least one first file is provided to the device. Systems are also disclosed. Methods and systems to enable users without system administrator rights to access and store data in a backup storage system are also disclosed.

Abstract: A device may process images (e.g. sort, group, file, e-mail, etc.) using various filters. The filters may relate to non-image data in the image files to be processed. The filters may include time and location filters.

Abstract: A desired object stored on a computer system is retrieved by retrieving one or more objects based on an object attribute to produce initial search results, selecting an object from the initial search results, where the selected object is associated with one or more other attributes, and retrieving one or more additional objects based on one or more of the other attributes of the selected object to expand the initial search results and provide the desired object. The objects are linked to one or more tree structures each associated with an object attribute, such that the retrieving one or more additional objects includes traversing the tree structures linked to the selected object and associated with the one or more other attributes to identify the one or more additional objects.

Abstract: A system and method for content sharing includes acquiring, by a processing device, a plurality of data objects from data sources, storing the plurality of data objects in a data warehouse, generating a high-level index that is shared by the plurality of data objects, generating a plurality of low-level indices that each provides a respective low-level index for a respective one of the plurality of data objects, and providing the plurality of data objects on the content sharing platform for query or search using the high-level index and the plurality of low-level indices.

Abstract: A distributed shared-nothing database provides serializable isolation for transactions and includes a mechanism for adding storage and processing capacity to the database without stopping the database from processing transactions.

Abstract: Systems and methods of placeshifting media playback between two or more devices are provided. For example, a method for placeshifting media may include downloading onto a first device an index of files accessed or modified on a second device via a data storage server, at least one of the files being a media file played on the second device. The first device may display a user selectable list of the files on the first device before issuing a request for the media file to the data storage server. The data storage server may send the media file to the first device from the data storage server, and the first device may play back the media file where the second device left off.

Abstract: In one implementation, a computer-implemented method includes accessing, by a computer system, information that describes use of one or more computer-based services by a particular user from one or more computing devices that are associated with the particular user; identifying one or more native applications that are associated with the one or more services, wherein the one or more native applications are configured to be installed and executed by one or more types of mobile computing devices; determining whether to recommend the one or more native applications based on the information and one or more threshold levels of use of the one or more computer-based services; and providing, based on the determining, a recommendation that is associated with the particular user and that identifies at least one of the one or more native applications.

Abstract: Data stores that store content units and annotations regarding the content units derived through a semantic interpretation of the content units. When annotations are stored in a database, different parts of an annotation may be stored in different tables of the database. For example, one or more tables of the database may store all semantic classifications for the annotations, while one or more other tables may store content of all of the annotations. A user may be permitted to provide natural language queries for searching the database. A natural language query may be semantically interpreted to determine one or more annotations from the query. The semantic interpretation of the query may be performed using the same annotation model used to determine annotations stored in the database. Semantic classifications and format of the annotations for a query may be the same as one or more annotations stored in the database.

Abstract: A method for calculating trust level of a user on social networking sites, comprising: consolidating information related to users operatively associated with at least a web based social platform; assigning weight to each of the consolidated information; computing aggregated score for at least an information; computing weighted average of the aggregated scores of the information; and calculating trust score based on the weighted average score. It further comprises assigning a trust level to the users based upon the trust. The method enables a user to create web of trust for social contacts or friends on the web based social platform wherein the web of trust comprises of most trusted friends, average trusted friends and least trusted friends.

Abstract: Provided are communication devices and methods for requesting content in a network based on a hierarchical name structure. A content requester may search for content without the use of the entire content name in the network based on the hierarchical name structure.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for updating text within a document. In one aspect, a method includes identifying an entity based on entity text included in document text of a document; identifying a time-sensitive attribute for the entity based on attribute text included in the document text; identifying a first value for the time-sensitive attribute based on value text included in the document text; generating a query specifying the entity; providing the query to a search system that provides a result value for the time-sensitive attribute of the entity included in the query; and providing, to a user device that is currently accessing the document, result data that causes presentation of the result value as a replacement for the first value.

Abstract: The invention relates to detecting non-presence of nodes in a document of semi-structured data and to creating a values index which properly reflects this non-presence. The document of semi-structured data, comprising multiple hierarchically organized nodes, is scanned for values (step 110). Subsequently, these values are indexed (step 120). As non-presence of at least one node is detected (step 140), this non-presence is documented by enhancing the values index (12) by a pseudo key (20) (step 150).

Abstract: A hypothesis associated with one or more data analytics tasks is obtained. One or more data sets, relevant to the hypothesis, are extracted from one or more data sources, wherein relevance to the hypothesis is determined by one or more selected analytical methods. The one or more extracted data sets are transformed based on one or more characteristics of the hypothesis and one or more privacy constraints associated with one or more data analytics tasks. The above steps are performed to automate at least part of a data analytics lifecycle.

Abstract: This disclosure relates to personalized and dynamic server-side searching techniques for encrypted data. Current so-called ‘zero-knowledge’ privacy systems (i.e., systems where the server has ‘zero-knowledge’ about the client data that it is storing) utilize servers that hold encrypted data without the decryption keys necessary to decrypt, index, and/or re-encrypt the data. As such, the servers are not able to perform any kind of meaningful server-side search process, as it would require access to the underlying decrypted data. Therefore, such prior art ‘zero-knowledge’ privacy systems provide a limited ability for a user to search through a large dataset of encrypted documents to find critical information.

Abstract: Methods and systems are provided for triggering a social match analysis. A user device such as a network connected device scans for one or more entity identifiers via camera, microphone, or wireless signal receiver and initiates a request to a social matching system. The social matching system retrieves attribute information for each of the identified entities and performs a match analysis, scoring the potential matches and noting common attributes. A match analysis report is generated and returned to the originating requesting user device.

Abstract: A website is augmented to indicate the presence of saveable enhanced book memos. A user can save an enhanced book memo to their memobook database, then view their saved book memos, either at the website, or using a downloaded program when not at the website. The enhanced book memos can include text and/or multimedia files that are not present on the website.

Abstract: A proxy server creates an index of keywords, receives an encrypted record, decrypts the received encrypted record as decrypted data and, when a keyword in the index is encountered in the decrypted data, associates in the index an encrypted record location identifier with the encountered keyword. The proxy server receives a search query and uses the keyword index to retrieve encrypted records from the server. The encrypted records are decrypted and sent as search results in response to the search query.

Abstract: Embodiments of the invention relate to a virtual file system for communicating changes in metadata associated with data archived in a data storage system to applications. An aspect of the invention concerns a system that comprises a virtual file system for storing metadata files wherein each metadata file is associated with an archived data file, and a virtual file system interface coupled to the virtual file system for exposing changes in the metadata files to the applications.

Abstract: A method, system and computer-usable medium for using cognitive graph vectors to refine cognitive insights.

Abstract: Embodiments of the present invention can be used to improve cross reference look-up performance by performing multi-table data segmentation. In accordance with an embodiment, a method of multi-table data segmentation can comprise augmenting each of a plurality of definition files associated with a database table with multi-table data. The method can further comprise creating a plurality of multi-tables. Each multi-table is associated with a different one of the plurality of definition files. The method can further comprise transposing data stored in the database table based on the plurality of definition files, and migrating the transposed data from the database table to the plurality of multi-tables.

Abstract: Using index clusters to approximate coordinate values for vertices of compressed simplexes of a spatial data set, valid subspaces can be identified and used to identify other simplexes that may intersect a first simplex. Such approaches can be used for filtering, refining, etc. analysis of intersections between areas, lines, volumes, etc. within spatial data sets.

Abstract: A system and machine-implemented method for detecting and processing invisible elements within a web page. A web page is accessed to detect one or more elements in the web page. One or more criteria for identifying web page elements, which are invisible when displayed, are obtained. The one or more criteria are applied to the one or more elements. Based on the applied criteria, a determination is made that one of the one or more elements is invisible. A notification of the invisible element is provided for display.

Abstract: In particular embodiments, one or more computer systems of a social-networking system identify a user viewing video content on a first display device, identify the video content being viewed on the first display device by the user, and determine a second display device associated with the identified user. The one or more computer systems of the social-networking system determine an action related to the video content being viewed by the user on the first display device and provide one or more instructions to the determined second display device to display a call-to-action associated with the determined action.

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: A method and system for managing semantic and syntactic metadata. Heterogeneous data is received. After the heterogeneous data is received, the semantic metadata associated with the received heterogeneous data is captured and syntactic metadata associated with the received heterogeneous data is captured. The semantic metadata describes contextually relevant or domain-specific information about data based on an industry-specific or enterprise-specific metadata model or ontology. The syntactic metadata included grammatical rules and structural patterns governing an ordered use of formats and arrangement pertaining to specified data. The received heterogeneous data and said captured semantic metadata and said syntactic metadata are logically linked. The heterogeneous data is stored in a repository.

Abstract: Present embodiments contemplate systems, apparatus, and methods to determine an appropriate focal depth for a sensor based upon a pair of stereoscopic images. Particularly, certain of the embodiments contemplate determining keypoints for each image, identifying correlations between the keypoints, and deriving object distances from the correlations. These distances may then be used to select a proper focal depth for one or more sensors.

Abstract: A system and a method are provided for querying a knowledge resource. The querying system is configured for executing queries in a query language that accepts global backreferences that are not limited to a being located in the condition including a regular expression (regex) to which the global backreference refers. In the method, an input query is received, a query based thereon containing one or more global backreferences is executed, and results are retrieved. One condition of the query includes a regex that identifies strings that match the regex. The regex includes one or more capturing groups for capturing substrings of an identified matching string. The global backreference retrieves the captured substring(s). Each global backreference in the query can be a remote backreference, which is outside the regex condition to which it refers, or a local backreference, which is in the same condition as the regex.

Abstract: A computer implemented method for analyzing a listing object to define a match to a candidate object among many possible candidate objects is disclosed. The method includes an operation to receive a listing object as an input. The method also includes an operation to generate a set of candidate objects based on characteristics of the listing object. The candidate objecting used to generate a listing-candidate pair defined by pairing the listing object with one of the candidate objects. The method may also include operations to process the listing-candidate pair such as an operation to normalize the listing object into a canonical form. Another operation can generate a matching feature vector for the listing-candidate pair. Where the matching feature vector includes a matching score based on a common feature between the candidate object and the canonical form of the listing object. In another operation, the method analyzes the matching feature vector with a judging committee module to render a match judgment.

Abstract: A method implemented on a computer for searching databases includes the computer receiving a search query for a database, the database including database fields; and dynamically providing and displaying a list of a plurality of the database fields. The list includes a descriptor indicating a data category of each database field. The computer also dynamically determines a quantity of entries in each database field. For each database field, the computer dynamically sets a limit based on a capacity to display the quantity of entries and for each database field having the quantity of entries exceeding the limit, the computer truncates data by adjusting a size of the quantity of entries until a displayable quantity of entries is achieved. The computer then displays the truncated data.

Abstract: A method of archiving audio/video content is presented. In the method, a plurality of audio/video content streams is received. Each of the received audio/video content streams is indexed according to time. Each of the indexed audio/video content streams is transferred to a data storage system for storage. A request for a portion of one of the stored audio/video content streams associated with a time period is received. The requested portion of the one of the stored audio/video content streams is retrieved from the data storage system. The requested portion of the one of the stored audio/video content streams is transferred.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for transferring money using email. One of the methods includes receiving, at a user device, user input of a request to transfer a payment amount from a recipient account with a payment service system to a sender account of a sender with the payment service system. A draft email message is generated, the message having content identifying the requested payment amount, the draft email message including a confirmation link to a network resource associated with the payment service system, wherein upon receiving an indication that the recipient selected the confirmation link, the payment service system identifies a sender account of the sender and a recipient account of the recipient and initiates a transfer of the requested payment amount from the recipient account to the sender account.

Abstract: Systems and methods are disclosed for inserting a key into and removing a key from a composite data structure including a radix tree and an auxiliary data structure. In an example, a method of inserting a key into the composite data structure includes receiving an instruction to store a first key in the composite data structure. The composite data structure stores a second key. The method further includes generating, based on comparing the first and second keys, one or more sequences of elements. The method also includes splitting each of the generated sequences of elements into a prefix and a suffix, storing the respective prefixes into the radix tree; and storing the respective suffixes into the auxiliary data structure.

Abstract: A method is disclosed of estimating significant places visited by a mobile-terminal user for wireless communication via base stations. The method includes: collecting at least one communication log represented with consecutive communication events between the mobile terminal and connected one of the base stations in a coverage area of each mobile terminal, the base stations being identified by unique base-station identifiers (BS IDs), respectively, each communication event including date and time of communication and one of the BS IDs which is indicative of the connected base station; dividing each communication log into consecutive time-windowed segments, using a discrete time window moving in time; and, per each time-windowed segment, estimating at least one significant place visited by the user, based on a probability distribution with which the BS IDs appear in each time-windowed segment.

Abstract: Embodiments include methods, apparatuses, and systems for generating an action item in response to a detected audio trigger during a conversation. Embodiments relate to generation of one or more action items in response to detection of an audio trigger, such as a spoken command, keyword, audio tone or other indicator, which is detected during a conversation, such as an audio or video conference or peer-to-peer conversation. The audio trigger and a portion of the conversation are then used to generate an action item relating to the audio trigger and an accompanying portion of the conversation. By automatically generating action items in real time as part of a conversation, action items can be captured and stored more efficiently, and the participants in the conversation are allowed greater confidence that all items requiring follow up actions are properly stored and organized.

Abstract: Communications between entities who may share common interests. For entities determined to be sharing common interests (e.g., searching using the same terms or topics, browsing a page, a site or a groups of topically related sites), options for communication among the entities are provided. For example, a chat room may be dynamically created for persons who are currently searching or browsing the same or related information. As another example, a “homepage” may be created for each query and contain various types of information related to the query. A permission module controls which entities may participate, what types of information (and from what sources) an entity can (or desires to) receive, what types of information the entity may (or desires to) share.

Abstract: A method for optimized route caching includes comparing a destination address of a network packet to a first set of prefixes in a routing cache, and comparing the destination address to a second set of prefixes in a full routing table when a longest matching prefix for the destination address is not found in the routing cache. The method further includes copying the longest matching prefix and a set of sub-prefixes of the longest matching prefix from the full routing table to the routing cache, and forwarding the network packet.

Abstract: Embodiments of techniques and systems for parallel processing of B+ trees are described. A parallel B+ tree processing module with partitioning and redistribution may include a set of threads executing a batch of B+ tree operations on a B+ tree in parallel. The batch of operations may be partitioned amongst the threads. Next, a search may be performed to determine which leaf nodes in the B+ tree are to be affected by which operations. Then, the threads may redistribute operations between each other such that multiple threads will not operate on the same leaf node. The threads may then perform B+ tree operations on the leaf nodes of the B+ tree in parallel. Subsequent modifications to nodes in the B+ may similarly be redistributed and performed in parallel as the threads work up the tree.

Abstract: Generating an optimized test suite for use in a software testing environment. This invention relates to software testing systems, and more particularly to generating an optimized test suite for using in a software testing system. The principal object of this invention is to propose a method and system for generation of an optimized test suite using a sequential process with a combination of custom and generic optimization techniques.

Abstract: Disclosed is a method and device for processing a time sequence based on dimensionality reduction, belonging to the technical field of computers. The method includes: acquiring at least one to-be-processed time sequence; processing the at least one time sequence based on Piecewise Linear Approximation (PLA) where a time length of a time segment processed by PLA is unfixed and is an integral multiple of a preset unit time length. According to the present disclosure, a space for storing a time sequence may be reduced.

Abstract: Systems and methods are disclosed for compressing a radix tree. An example method of compressing a radix tree including a plurality of containers includes traversing a radix tree including a plurality of containers. The method also includes identifying, based on the traversing, a parent container that represents a sequence of elements and has a single immediate child container. The parent container includes a prefix of the sequence of elements that is represented by the parent container, and the immediate child container includes a single element. The method further includes determining whether a length of the sequence of elements that is represented by the parent container satisfies a container threshold. The method also includes when the length is determined to satisfy the container threshold, selecting one of the parent container and immediate child container, incrementing a length of the selected container, and removing the non-selected container from the radix tree.

Abstract: A facility for representing in a relational database informational content of the series of tag-language messages is described. The facility reads an arbitrary number of the tags contained by the series of messages. For each read tag, the facility determines a path for the tag, the name of a relational table assigned to the path, values specified for the tag and/or attributes of the tag, in the name of columns of relational tables assigned to the tag and/or tag attribute values. After doing this processing, the facility updates the relational database so that and it includes all of the assigned relational tables and a relational table columns, and populates the value specified for the tags and/or attributes of tags to the relational database.

Abstract: A computer receives a retrieval request with a retrieval character string, adds control information to a region corresponding to code information included in a management region used for extending encoded data when an extension result of the code information matches a first character of the retrieval character string when the encoded data to be retrieved is sequentially extended in response to the retrieval request, and performs collation processing between the retrieval character string and character string information corresponding to data of the extension result of the code information when the control information is added to a partial region corresponding to code information to be extended in the extension.

Abstract: Methods for non-exclusionary searching within clustered in-memory databases are disclosed. The non-exclusionary search methods may allow the execution of searches where the results may include records where fields specified in the query are not populated or defined. The disclosed methods include the application of fuzzy matching and scoring algorithms, which enables the system to search, score and compare records with different schemata. This may significantly improve the recall of relevant records.