Abstract: Providing contextual messages from a service to a user in a native application on a system. Embodiments determine a user specific context within the general context of the native application on a first device and provide in a user interface to the user information about the user specific context.

Abstract: In one example, a system is described in which a storage device, communicatively coupled to a processor, includes a file system management module. This file system management module may create a hierarchical organization directory that is a device and an operating system independent under a root directory in a namespace of a file system. Further, the file system management module may create a user directory under the hierarchical organization directory. Furthermore, the tile system management module may create policy and configuration data for the user directory. In addition, the file system management module may store the policy and configuration data created for the user directory in the hierarchical organization directory.

Abstract: A geographical information system (GIS) is described that enables querying, analysis and visualization of real-time streaming data pertaining to at least one moving object or entity (e.g., vehicles, people, sensors, weather phenomena, etc.) in conjunction with relatively static multi-temporal geospatial data. An application programming interface is provided to present the GIS functionality for handling dynamically moving objects or entities to clients.

Abstract: A method and an apparatus of publishing information are disclosed. The method includes receiving input information of a user; extracting one or more keywords from the input information of the user; performing a search based on the one or more keywords, to obtain at least two data objects, each data object including at least one picture; extracting at least partial images from respective pictures of the at least two data objects; generating a combined image according to the at least partial images that are extracted; and sending the combined image to the user. Using the technical solution provided by the present application, published information is no longer information of a single data object, but a combination of information of multiple data objects, such that a display effect after information publishing is better.

Abstract: A notification computer system can retrieve an event data element from a queue in an entitlement computer system. The event data element can represent a change to an entitlement record of a profile's entitlement to a computer service. The notification system can process the event data element, which can include accessing and applying a computer-readable rule data structure that governs processing of events from the event queue. The processing can also include generating a notification in a manner dictated by the rule data structure, with the notification indicating the change to the data structure represented by the event data element. The processing of the event data element may also include sending the notification to an entitled profile whose entitlement to a computer service is represented by the entitlement data structure.

Abstract: A computer-implemented method and system are provided for monitoring developments in a field of prior art. The method comprises using one or more processors receive a search query including a first patent concept related to the field of prior art; search the Internet as a function of the search query; generate a first set of search results; store the first set of search results in a database; conduct a subsequent search on the Internet as a function of the search query; generate a second set of search results; compare the first and second sets of search results to identify differences in the results; and communicate the differences to a user. An ontology of patent concepts may be stored in a system database. The searches may be conducted automatically on a regular basis thereby notifying the user of any intervening changes in the field of prior art.

Abstract: A method includes, for a write operation regarding a set of encoded data slices, determining, by a computing device, whether the write operation is a first instance of writing the set. The method further includes, when the write operation is a first instance, sending, by the computing device, a set of write requests to the storage units, wherein the write requests includes the set of encoded data slices, slice names, and an indication of the first instance. The method further includes, in response to a write request of the set of write requests, determining, by a storage unit, whether a previous version of an encoded data slice is currently stored. The method further includes, when the previous version is currently stored sending, by the storage unit, a conflict message to the computing device. The method further includes updating, by the computing device, the write requests based on the conflict message.

Abstract: A method for archiving data relative to a user equipped with an electronic apparatus and having a user account on a server including a database, the method including: transmitting the data relative to the user from an electronic device to the server; storing the data relative to the user in a first container of the database of the server; generating, by the server, a temporary reference associated with the first container of the database; transmitting the temporary reference from the server to the electronic apparatus; accessing the data relative to the user from the electronic apparatus, a connection between the electronic apparatus and the server having been established previously.

Abstract: An information acquisition method, device and system are provided. The method includes: a request for retrieving event information for a first terminal is acquired; a second terminal storing the event information is determined; and the second terminal is controlled to send the event information to the first terminal.

Abstract: An attribute bit-state mapper to receive state decisions, each state decision including a current one-bit state and identity information, the current one-bit state corresponding to a one-bit answer from a decision network indicative of a state of an attribute of an entity of a population of entities identified by the identity information. The attribute bit-state mapper to assign each population of entities to a population data set, and to assign to each entity of a population data set coordinates with the corresponding population data set. The attribute bit-state mapper further to maintain for each population data set a current data set including, at the assigned coordinates, the current bit-state for each entity, and a past data set comprising a copy of the current data set from an earlier point in time.

Abstract: A method for mapping a first address space to a second address space is provided. In some embodiments, the method includes creating a first array of lookup entries and one or more second arrays of metadata entries for maintaining an ordering among the lookup entries using a tree structure. Each of the metadata entries includes one or more data index values identifying a corresponding one of the lookup entries by its position in the first array and one or more metadata index values identifying a corresponding one of the metadata entries by its position in one of the one or more second arrays. The method further includes receiving a request including a lookup value, traversing the tree structure to locate a lookup entry corresponding to the lookup value, and when the lookup value is located among the lookup entries, using the located lookup entry to process the request.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing read queries latch-free access to an index page. In an embodiment, a processor receives a request from a read query to access one or more records of an index page. The index page includes an update pointer and a slot array. The processor locates one or more updates prepended to the index page by locating a most recently prepended update indicated by the update pointer. Then, the processor generates a local offset table with entries in the slot array and the located one or more updates. The generated local offset table enables the processor to provide the read query access to the one or more records of the index page.

Abstract: A split-index can be employed for access to external data. The index can be created on a primary data storage system for data stored externally on a secondary data storage system. After creation, the index can be utilized to expedite at least query execution over the externally stored data. The index can be updated upon detection of changes to data. Further, even when the index is not completely up to date, the index can be exploited for query execution. Furthermore, hybrid execution is enabled with the index and without the index.

Abstract: A method for synchronizing management of a plurality of domain names in a Domain Name System (DNS).

Abstract: A system is provided that ensures read-after-write consistency. During operation, the system receives, from a user, a write to a record having a primary key in a master key-value store, wherein the write specifies a secondary key for the record. The system then caches the secondary key and the primary key in a cache entry in a cache, wherein the cache entry is associated with the user. Next, the system applies the write to the master key-value store. Prior to propagation of the write from the master key-value store to a derived key-value store that maps secondary keys to primary keys, the system receives from a given user a query for the record, the query comprising the secondary key and not the primary key. Next the system translates the secondary key to the primary key by querying the cache when the given user is the user.

Abstract: Described are methods, systems and computer readable media for the importation, presentation, and persistent storage of data.

Abstract: System and method of verifying validity of a metadata modification request to prevent improper metadata operations. During initialization of a volume in a storage device and once a metadata area is reserved for a metadata structure, information characterizing the metadata structure and metadata area is stored in the storage device, which may be in the form of an area legend composed of descriptors such as a magic signature, a node size, a clump size of reservation, and extent of the metadata area. Responsive to a request for operating on metadata, relevant information provided in the request is verified against the stored characteristic information. If the verification discovers an inconsistency between the information provided in the request and the stored characteristic information, the request modification is treated as invalid and blocked from operation.

Abstract: A method for filtering data series includes filtering, by filtering entities, the data series by: collecting a data series including original information; reducing the original information of the data series based on and by at least one data reduction procedure to produce at least one set of reduced information of the data series; reconstructing the original information for the at least one set of reduced information of the data series; calculating a level of reconstruction for the reconstructed information based on a comparison between the reconstructed information and the original information for the at least one data reduction procedure; and determining reduced or non-reduced information of the data series to be forwarded based on a comparison between a desired level of reconstruction and the calculated level of reconstruction.

Abstract: A data processing apparatus is provided. The apparatus includes a CPU that registers, by a user for each of plural services, a sample and a criterion for the sample, both of which are different for each service; transmits the sample to each of plural providers of the service corresponding to the sample; receives, from each provider, a result of performing the service on the sample; evaluates, for each provider, the result according to a match rate with a character indicated by the criterion for the sample; and transmits original data to a provider based on the evaluations.

Abstract: A system, method, and computer-readable medium for performing in-database operations, comprising: presenting an automation interface to a user, the user interface automation interface enabling a user to select one or more key performance indicators; instantiating an in-database processing operation, the in-database processing operation performing feature selection from a high dimensional parameter space; executing at least one database statement within the storage system to derive a subset of diagnostic parameters from the high dimensional parameter space.

Abstract: Methods and systems are provided for narrowing a scope of a search on a computing device to provide relevant search results to the user. Prior to receiving a search query from the user in a search box of a desktop taskbar, scope options are communicated for presentation from which the user can select. These scope options enable the user to select from web-based searches and local searches. A selection is received form the user of one of the scope options. Suggested search results are generated based on this scope option selection. At least one suggested search results is communicated for presentation on a display of the computing device.

Abstract: An analytics system for providing an interface for supporting analytics processing of data of a data store is provided. The system receives an analytics data model and a mapping of a data model to the analytics data model. The system initializes a data store that supports the analytics data model by extracting data from the data store and storing the extracted data in the analytics data store based on the mapping. Upon receiving a notification of a change to data of the data store, the system updates the data of the analytics data store as indicated by the mapping. The system receives, via an analytics interface, a query based on the analytics data model and converts the query into a store query. The system submits the store query to the analytics query engine to generate a query result and provides the query result as the result of the query.

Abstract: Methods, systems, and apparatus, including computer program products, for identifying the language of a search query. In one embodiment, the language of each term of a query is determined from the query terms and the language of the user interface a user used to enter the query. In another embodiment, an automatic interface language classifier is generated from a collection of past queries each submitted by a user. In some embodiments, a score is determined for each of multiple languages, each score indicating a likelihood that the query language is the corresponding one of the multiple languages.

Abstract: One embodiment is a method to manage queries in a database. The method identifies a query that executes on the database for an elapsed time that is greater than a threshold and then implements a remedial action when the query executes on the database for an execution time that is greater than an estimated execution time.

Abstract: To reduce the overall computation time of a batch of queries, multiple query optimization in SQL-on-Hadoop systems groups multiple MapReduce jobs converted from queries into a single one, thus avoiding redundant computations by taking sharing opportunities of data scan, map function and map output. SQL-on-Hadoop converts a query into a DAG of MapReduce jobs and each map function is a part of query plan composed of a sequence of relational operators. As each map function is a part of query plan which is usually complex and heavy, disclosed method creates a cost model to simulate the computation time which takes both I/O cost for reading/writing input file and intermediate data and CPU cost for the computation of map function into consideration. A heuristic algorithm is disclosed to find near-optimal integrated query plan for each group based on an observation that each query plan is locally optimal.

Abstract: A computer-implemented method includes receiving a query plan. The method includes identifying a plurality of qualified relevant rows and one or more encoding candidate payload columns. The method includes analyzing the relevant rows in the encoding candidate payload columns to yield a count of distinct contents and a payload column width. The method includes estimating a cost and determining whether the cost is larger than an amount of available memory for on-the-fly encoding all of the plurality of encoding candidate payload columns. The method is responsive to the estimated cost being less than the amount of available memory, by on-the-fly encoding the encoding candidates and responsive to the estimated cost being greater than the amount of available memory by on-the-fly encoding fewer than all of the encoding candidates so as not to exceed the available memory, and leaving alone one or more remaining encoding candidate payload columns unencoded.

Abstract: An example computer-implemented method includes receiving, via a processor, a plurality of structured query statements associated with an application and a database. The method includes detecting, via the processor, a logical relationship between at least two of the plurality of structured query statements based on a common source, a predetermined threshold time, a common transaction. The method includes generating, via the processor, a model based on the detected logical relationship. The method further includes receiving, via the processor, a request to modify the database. The method also further includes modifying, via the processor, the database in response to detecting that a predetermined threshold probability of application functionality impairment is not exceeded.

Abstract: Exemplary embodiments of the present disclosure provide a method, apparatus, and computer-readable medium for identifying. An exemplary method includes providing a plurality of identifiers from a plurality of data sources, the plurality of identifiers corresponding to a plurality of entities, and creating a plurality of tuples based on the plurality of identifiers, wherein each one of the plurality of tuples corresponds (i) a particular one of the plurality of data sources and (ii) to at least two identifiers that are linked together. The method further includes receiving an identifier, and determining whether the received identifier matches any of the plurality of tuples.

Abstract: Systems and methods for visualizing and manipulating graph databases in accordance embodiments of the invention are disclosed. In one embodiment of the invention, a graph database manipulation device includes a processor and a memory configured to store a graph database manipulation application, wherein the graph database manipulation application configures the processor to obtain a graph database including a set of nodes and a set of edges, determine a source node within the set of nodes, locate a set of related nodes based on the source node and the set of edges, recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, generate a representation of the set of related nodes from the perspective of the source node, and recursively update the generated representation of the set of sub-related nodes from the perspective of the source node and the related nodes.

Abstract: Delegating queries within a transformation chain that match delegable query patterns associated with external services. One or more matches between one or more delegable query patterns associated with one or more external services and one or more queries included within the transformation chain are identified. Execution of the one or more identified queries is then delegated to the one or more external services. Upon execution of the one or more identified queries, one or more results associated with the execution are then received. Once the one or more results have been received, the results are implemented within the transformation chain.

Abstract: A control apparatus of an automation system, the control apparatus includers a database adapted to store time series data in a historian data source and adapted to store events derived from the time series data based on event detection rules in an event data source, wherein a semantic data or event query received by the control apparatus is mapped to a corresponding data source of the database to retrieve the queried data or event which are contextualized using an ontological context model of the automation system stored in the database and output by said-control apparatus in a semantic format is provided.

Abstract: Embodiments of the present application provide a search method and apparatus. The search method comprises: in response to a predetermined movement of at least one body part on a display screen, determining at least one piece of content associated with at least one biological feature of the at least one body part; and performing a search at least according to the at least one piece of content. The embodiments of the present application provide a search solution.

Abstract: A question relating to an individual is received and context from the question is extracted. Subject matter criteria can be identified from the context of the question. A database containing history data that includes recorded positional data for physical objects relative to the location of the individual at the time of recording can be accessed and relevant physical objects from the history data can be identified based upon the subject matter criteria. A set of answers can be generated for the question from a corpus of data and ranked based upon the identified physical objects and physical distance between the individual and the relevant physical objects.

Abstract: Embodiments are directed to providing event context assistance. In one scenario, a computer system detects the occurrence of a specified event that has an associated level of priority. The computer system determines that the level of priority for the specified event is sufficient to trigger retrieval of data from a data store, and further evaluates the specified event using the retrieved data to create an event data structure that provides relevant contextual information related to the specified event. The computer system then provides the created event data structure to a user or other entity.

Abstract: System and methods for performing automatic identification and contextual reformulation of implicit device-related queries are described. In some examples, a query server may receive a query from an electronic device, receive data associated with the electronic device, determine that the query is related to the electronic device, generate a new query based at least in part on the query and the data associated with the electronic device, retrieve results related to the new query, and send the results related to the new query to the electronic device. In some examples, determining that the query is related to the electronic device includes determining that the query is a semi-implicit device query or a fully implicit device query. The data associated with the electronic device can include a model name of the electronic device, an operating platform for the electronic device, and/or additional data related to the electronic device.

Abstract: In one embodiment, a method comprises defining a set of concepts based on a first set of structured and unstructured data objects, defining a business rule based on the set of concepts, applying the business rule to a second set of structured and unstructured data objects to make a determination associated with that set, and outputting to a display information associated with the determination.

Abstract: Transforming time series data points from concurrent processes is described. A time series database system writes, to a queue, a first time series data point received from a first process. The time series database system writes, to the queue, a second time series data point received from a second process that executes concurrently with the first process. The time series database system removes the first time series data point and the second time series data point from the queue. The time series database system creates transformed time series data by applying a transformation to the first time series data point and the second time series data point. The time series database system outputs the transformed time series data to a user device.

Abstract: Data conversion circuitry receives structured records including normalized data and performs a data conversion process on the structured records to generate unstructured records including unstructured syntax. The data conversion circuitry performs the data conversion process according to an unstructured syntax requirement including a syntax field mapping between the structured records and the generated unstructured records.

Abstract: Data processing flow is provided as a set of system states significant for the process. Data and processes are bound using universal computing elements, and thus provided as finite-state automata with explicit selection of states in real-time operation, thereby facilitating construction of finite-state automata (i.e., processes) to users who are not programmers. Advantageously, data processing is organized to reduce impact of inefficient conventional data usage, particularly via data transfer processed innovatively into state format and usage of automata-based programming for data processing.

Abstract: A method and system for generating structured data from semi-structured data are provided. The method includes reading a plurality of records from a data file including semi-structured data. Further, the method includes obtaining aligned delimiters in a list for every record that has been read. The method also includes selecting a most occurring delimiter from the list. The method then includes constructing a regular expression using the selected delimiter to split the records into different fields. The method also includes reconstructing the records for the regular expression to fit and split into fields. In addition, the method includes displaying the records split into the fields.

Abstract: Visually interactive identification of a cohort of similar data objects is disclosed. One example is a system including a data processor to access a plurality of data objects, each data object comprising a plurality of numerical components, where each component represents a data feature of a plurality of data features, and to identify, for each data feature, a feature distribution of the numerical components. A selector selects a sub-plurality of the data features of a query object, where a given data feature is selected if the component representing the given data feature is a peak for the feature distribution. An evaluator determines a similarity measure based on the sub-plurality of the data features. An interaction processor iteratively processes selection of a sub-plurality of the data features based on domain knowledge, and identifies, based on the similarity measures, a cohort of data objects similar to the query object.

Abstract: A method of transferring data between database locations comprising: providing a location reference comprising location values of one or more data collections stored in a database; providing an indicator in association with at least one data collection of the one or more data collections, the indicator being provided in response to initiation of a transfer process of the at least one data collection from a first location of the database to a second location of the database; wherein the indicator is changeable between a first state and a second state, the first state being indicative of the initiation of the transfer process; and as part of the transfer process of the at least one data collection, selectively updating a location value of the at least one data collection in the location reference, in dependence on a determination of whether the indicator is in the first state or the second state.

Abstract: An instance of a consensus protocol in initiated by a processor initiating an application program interface to submit a value and obtaining the value. The processor sends a message including the value to one or more hardware components communicatively coupled to the processor. Logic in the hardware components obtains the message and appends the message with a sequence number, where the sequence number identifies the instance. Logic in the hardware accepts the value and supplies the value to the processor. The processor replicates the value for the instance and returns the value to the application via a callback.

Abstract: A team-centric computerized document management system includes at least one data record, one or more collaboration spaces associated with said data record, for each collaboration space, one or more teams having access to said collaboration space, where each team has one or more users associated with it, an access permissions data module, holding data on access permissions, where the access permissions between users within teams are identical, such that when a particular user in the team may access a particular data record or collaboration space, other users in the team may access the exact same information, a document data module, holding meta data on documents, where each document is associated with a particular collaboration space and each document has permission definitions, and a document synchronization module, operable when a team elects or is being dictated a document management system.

Abstract: One or more techniques and/or computing devices are provided for secure data replication. For example, a first storage controller may host first storage within which storage resources (e.g., files, logical unit numbers (LUNs), volumes, etc.) are stored. The first storage controller may establish an access policy with a001 second storage controller to which data is to be replicated from the first storage. The access policy may define an authentication mechanism for the first storage controller to authenticate the second storage controller, an authorization mechanism specifying a type of access that the second storage controller has for a storage resource, and an access control mechanism specifying how the second storage controller's access to data of the storage resource is to be controlled. In this way, data replication requests may be authenticated and authorized so that data may be provided, according to the access control mechanism, in a secure manner.

Abstract: In an example, a method of transferring data may include synchronizing work-items corresponding to a first subgroup and work-items corresponding to a second subgroup with a barrier. The method may include performing an inter-subgroup data transfer between the first subgroup and the second subgroup.

Abstract: Embodiments of the present invention disclose a computer program product for rebalancing partitioned data based, at least in part, on limit key extrapolation in a database and one or more characteristics of the plurality of database partitions. Responsive to a determination that an upper limit key value of the last loaded record is greater than an upper limit key value of an empty partition, the computer redefines the upper limit key value of the empty partition using an extrapolated upper limit key value that is based, at least in part, on a range of limit key values. The computer updates one or more characteristics of the database, wherein the one or more characteristics include one or both of a) an average number of records per partition, and b) an average number of unique limit key values per partition.

Abstract: A method for a multi-cluster warehouse includes allocating a plurality of compute clusters as part of a virtual warehouse. The compute clusters are used to access and perform queries against one or more databases in one or more cloud storage resources. The method includes providing queries for the virtual warehouse to each of the plurality of compute clusters. Each of the plurality of compute clusters of the virtual warehouse receives a plurality of queries so that the computing load is spread across the different clusters. The method also includes dynamically adding compute clusters to and removing compute clusters from the virtual warehouse as needed based on a workload of the plurality of compute clusters.

Abstract: Techniques are described for performing cluster analysis on a set of data points using tri-point arbitration. In one embodiment, a first cluster that includes a set of data points is generated within volatile and/or non-volatile storage of a computing device. A set of tri-point arbitration similarity values are computed where each similarity value in the set of similarity values corresponds to a respective data point pair and is computed based, at least in part, on a distance between the respective data point pair and a set of one or more arbiter data points. The first cluster is partitioned within volatile and/or non-volatile storage of the computing device into a set of two or more clusters. A determination is made, based at least in part on the set of similarity values in the tri-arbitration similarity matrix, whether to continue partitioning the set of data points.

Abstract: Systems and techniques for determining an expertise of an employee in an enterprise are described. A crawler may examine one or more external data sources that are external to an enterprise network associated with the enterprise to identify one or more documents associated with the employee. The external data sources may include patent databases, technical paper databases, and the like. A classifier may be used to determine keywords in the one or more documents. For each of the keywords, a term frequency-inverse document frequency (TF-IDF) value may be determined. The keywords may be ranked based at least in part on the TF-IDF value associated with each keyword to create ranked keywords. The ranked keywords may be displayed. A font characteristic used to display a particular keyword of the ranked keywords may be determined based at least partly on the TF-IDF value associated with the particular keyword.