Abstract: A method, systems for a packet capture engine for commodity network interface cards (NICs) in high-speed networks that provides lossless zero-copy packet capture and delivery services by exploiting multi-queue NICs and multicore architectures. The methods, systems include a ring-buffer-pool mechanism and a buddy-group based offloading mechanism.

Abstract: A pair of system tables are created in a system tablespace of a database and store free-form data that is defined by, and provided by, an end user. The information in a first system table determines whether a user table in a user tablespace of the database is capable of being annotated with the free-form data. The second system table stores the free-form data that is used to annotate that user table. So maintained, third parties can access the free-form data for analysis.

Abstract: A facility for interacting with an electronic document is described. The facility causes to be displayed a visual representation of the document, and receives input representing a painting interaction with a portion of the displayed visual representation of the document that corresponds to a portion of the document. In response to receiving the first input, the facility imposes on the corresponding portion of the document a distinguished content classification level.

Abstract: A method for data security is provided. The method may include obtaining a first object which is set as a sensitive object. The method may also include obtaining a second object, whereby there is a first relationship between the second object and the first object. The method may further include setting the second object as a sensitive object, in response to determining that the first relationship represents that there is strict correlation between the second object and the first object.

Abstract: A method for reducing data transfer connections is provided. The method may include receiving data requests associated with devices. The method may further include collecting data associated with the devices based on the data requests. Additionally, the method may include identifying applications for receiving the collected data. The method may also include generating datasets based on the collected data and the identified applications, wherein the datasets include collected data that is combined based on a commonality for transmission to one or more common applications. The method may further include generating passwords for the datasets. The method may also include encrypting the passwords. The method may further include generating data blocks, including a dataset, the generated and encrypted passwords, and UUIDs for each application. The method may also include transmitting the data blocks to the identified applications.

Abstract: A method and a system of managing a policy managed system that includes a policy managed element. The method restricts the policy managed element so that internal configurations and actions of the policy managed element do not violate any policy rules generated external to the policy managed element. The method also prevents the policy managed element from generating policy that exit the policy managed element. The method, at a policy executive element (PEE) located remote from the policy managed element, restricts internal configurations and actions of the PEE so that the PEE does not violate any policy rules generated external to the PEE. The PEE includes a policy generation point (PGP) that the method allows to generate new policy rules that do not violate any existing policy and provides the new policy rules to the policy managed element.

Abstract: A service proxy services as an application programming interface proxy to a service, which may involve data storage. When a request to store data is received by the service proxy, the service proxy encrypts the data and stores the data in encrypted form at the service. Similarly, when a request to retrieve data is received by the service proxy, the service proxy obtains encrypted data from the service and decrypts the data. The data may be encrypted using a key that is kept inaccessible to the service.

Abstract: A method of identifying targets for monitoring includes: obtaining a user-defined filter map, the user-defined filter map having one or more filter rules for matching against network traffic when the user-defined filter map is used by a network system to process the network traffic; and determining a set of one or more targets by a processing unit based at least in part on the user-defined filter map, wherein the processing unit comprises a target selection module configured to access a list of available targets from a database, and select the one or more targets from the list of available targets based at least in part on the user-defined filter map.

Abstract: Example control methods of hybrid storage are provided, which are applied to each HDD-type storage device and each SSD-type storage device in a storage system having one or more HDD-type storage devices and one or more SSD-type storage devices. Each HDD-type storage device in the storage system is connected to the SSD-type storage device. Each HDD-type storage device and each SSD-type storage device stores one or more data blocks respectively. Access information of each data block stored in a storage device is periodically acquired. A storage location of each data block in the storage system is adjusted according to the acquired access information of each data block. By using the technical solution of the present disclosure, the storage location of the data block is dynamically configured according to an access frequency so that advantages of different storage devices are fully utilized.

Abstract: A method for providing annotation summaries for annotations is provided. The method may include receiving annotations associated with analyzed unstructured data. The method may further include sorting the received annotations. Additionally, the method may include receiving focal points on the analyzed unstructured data. The method may also include extracting the sorted annotations associated with the focal points. The method may further include normalizing terms and phrases associated with the extracted annotations. The method may also include determining topics based on the normalized terms and phrases associated with the extracted annotations. The method may further include grouping the extracted annotations based on the determined topics. The method may also include summarizing the grouped annotations to generate a summarized annotation. The method may further include replacing the extracted annotations with the summarized annotation.

Abstract: Techniques are described for building, managing, and enforcing nested quota trees in a filesystem of a data storage system using internal filesystem structures. Such integrated, server-based, nested quota trees avoid the management overhead, communication delays, and slowed processing of proxy-based solutions and are thus more efficient and optimal.

Abstract: Methods and systems for virtualizing and managing cloud storage sources are disclosed. The method includes detecting devices in communication with a docking station and identifying a file on one of the devices. The method also includes identifying a plurality of cloud storage sources and calculating a weighted value for each storage source among the plurality of storage sources. The method further includes selecting a storage location within the plurality of cloud storage sources based on the calculated weighted values and storing the file at the selected storage location.

Abstract: A method for reducing data transfer connections is provided. The method may include receiving data requests associated with devices. The method may further include collecting data associated with the devices based on the data requests. Additionally, the method may include identifying applications for receiving the collected data. The method may also include generating datasets based on the collected data and the identified applications, wherein the datasets include collected data that is combined based on a commonality for transmission to one or more common applications. The method may further include generating passwords for the datasets. The method may also include encrypting the passwords. The method may further include generating data blocks, including a dataset, the generated and encrypted passwords, and UUIDs for each application. The method may also include transmitting the data blocks to the identified applications.

Abstract: The disclosure is generally directed to a method and computing device for maintaining dependencies among multiple reference elements (e.g., formulas of a table or spreadsheet). In various embodiments, prior to a reevaluation operation carried out on the reference elements, a computing device receives an input of a reference element via a user interface (e.g., receives a user's input of a formula), assigns the reference element to a group based on the dependency between the reference element and one or more other reference elements, and assigns the reference element to a location within a dependency graph to which the other reference elements are assigned. In response to an event that requires at least one of the reference elements to be reevaluated, the computing device reevaluates each group of reference elements in sequence a group at a time.

Abstract: An encryption recommendation method and an encryption recommendation device are provided. The method includes: scanning user operations on an application in a terminal, and obtaining a frequency of usage of each application; obtaining a set of frequently-used applications from the applications based on the frequency of usage of the each application; and determining, based on privacy weights of the set of frequently-used applications, at least one recommended application to be encrypted from the set of frequently-used applications.

Abstract: The disclosure discloses a method and device for call playback in a ringing state. The method includes that: after forwarding a call request initiated by a user terminal, and when receiving a first temporary response message returned by a called party, an Access Transfer Control Functionality (ATCF) applies for a media resource for a first playback media and performs playback on the first playback media, wherein the first temporary response message carries description information about the first playback media; when receiving an nth temporary response message of the call request, the ATCF reapplies for a pair of media resources to anchor an nth playback media, wherein the nth temporary response message carries description information about the nth playback media, and n is a natural number which is greater than or equal to 2; and the ATCF performs playback on the nth playback media through the pair of media resource.

Abstract: Disclosed herein is a system and method for managing collaborative electronic data that is owned by two different users who belong to different organizations. Both users are also granted ownership rights of collaborative electronic data created by the users. Users then contribute to the collaborative electronic data by providing information that may be confidential to their organization. The users want to ensure that they can cut off access to the confidential information if and when the relationship between the users or organizations sours. When one of the users with ownership privileges decides to end the cooperation with the other users, that user simply revokes access to the collaborative electronic data to the other user. As a result of the revocation all users are no longer able to see or access at least a portion of the collaborative electronic data to protect confidential information of all the parties.

Abstract: A virtual world processing apparatus and method. Sensed information, which is information collected by a sensor is inputted. The sensed information is adapted, based on a sensor capability, which is information on capability of the sensor. Accordingly, interoperability between a real world and a virtual world or interoperability between virtual worlds may be achieved.

Abstract: Various embodiments are directed to techniques for controlling access to data in a decentralized manner. An apparatus includes an apportioning component to divide an item of data into multiple portions based on an organizational structure of the item of data; a tree component to generate a PRN tree including a multitude of nodes and a branching structure based on the organizational structure, the multitude including at least one branching node and multiple leaf nodes that correspond to the multiple portions; a PRN component to generate a PRN for each node of the multitude, the PRN component to use a PRN of a branching node of the PRN tree to generate a PRN for a leaf node that depends therefrom; and a communications component to transmit the multiple portions and multiple addresses based on PRNs of leaf nodes of the PRN tree to a server. Other embodiments are described and claimed.

Abstract: A system, method, and computer-readable medium for optimizing complex SQL statements using a region divided preferential SQL rewrite operation. The region divided preferential SQL rewrite operation makes it possible for a user to inference a machine SQL statement rewrite operation to optimize the SQL statement with more or less focus on different regions of the SQL. This operation combines the strength of using heuristic knowledge and understanding of data to rewrite the region of the SQL statement where the problem originates with the precision and efficiency of a machine SQL statement rewrite operation.

Abstract: Various examples are directed to systems and methods for database migration. A data migration system may access schema data describing data stored at a database. The data migration system may identify a first segment of the first plurality of records having a first value for a first segmenting parameter and a second segment of the first plurality of records having a second value for the first segmenting parameter. The data migration system may begin to migrate the first segment of the first plurality of records. After the first segment of the first plurality of records is migrated, the data migration system may begin to migrate the second segment of the first plurality of records.

Abstract: Systems and methods are provided for providing a platform to provide virtual storefronts to consumers. Environmental elements are associated with specific consumer services on computer server. A user in the environment takes audio or visual recordings of an environmental element and uploads the recordings to the server. The server determines the appropriate consumer service associated with the recorded environmental element and provides the user with a reference to the service. Accordingly, any space, such as a bus stop, subway or train terminal, movie theater, or airport, may be turned into a virtual store.

Abstract: Techniques are disclosed for managing and allocating resources based on resource policies in response to user requests. A resource management system can receive a request for a service. A request may indicate preferences for allocation resources (e.g., a resource definition) to enable the service. A resource definition may indicate a topology of the computing resources to allocate for the user. The topology may indicate what computing resources to allocate and how to allocate those computing resource. Based on the information indicated by a request, the resource management system may determine a placement policy for allocation of computing resources indicated by the request. A placement policy may indicate a placement of one or more computing resources requested by a user. The placement policy may indicate where and how computing resources are to be placed once allocated. The computing resources may be allocated based on the placement policy and the resource definition.

Abstract: Systems and methods are provided for high-performance data processing. A policy is received that indicates a cutoff time. A request is processed to return the data item from the cache if the cutoff time is satisfied for the data item or return the data item from the database or not at all if the cutoff time is not satisfied for the data item. If the data item retrieved from the database, metadata associated with the data item is stored to indicate when the data item was last marked as in sync with the database.

Abstract: The technology disclosed relates to incorporating social data in CRM systems by a single social syn action. In particular, it relates to appending social data to prospect or contact objects of CRM systems by finding multiple social handles for the prospect or contact objects. The multiple social handles identify social profiles of the corresponding prospects or contacts on various social network platforms. The technology disclosed also relates to personalizing customer service experience of customers. In particular, it relates to identifying conversation preferences and interests of the customers based on information specified in their social profiles on different social network platforms. The conversation preferences and interests are used to customize interactions with the customer during the course of the customer service.

Abstract: A method and apparatus for handling trust in an IP Multimedia Subsystem network. A node in the IP Multimedia Subsystem network receives a Session Initiation Protocol message from a remote node. The message includes an indicator indicating the level of trust of a communication sent from the remote node to the IP Multimedia Subsystem node. The node can then apply a security policy to the message, the security policy being determined by the indicator.

Abstract: A system and method for protecting data in a protected storage system. A replication of the protected storage system at a predetermined time point is stored in an object-based storage in replicated content objects of a target disk. Information related to a write operation in the protected storage system is obtained, the information including: data stored on the protected storage system and metadata related to the stored data. A journal is maintained by: including a copy of the stored data in a content entry in one or more journal content objects, including at least some of the metadata in a metadata entry in one or more metadata objects, storing the journal content objects and metadata objects in the object-based storage, and associating the metadata entry with the content entry. The data received before a predetermined time window is periodically moved from the journal to the target disk.

Abstract: A resource management solution for use in a data-processing infrastructure comprising a server data-processing entity and a set of target data-processing entitiesthat is operable for downloading a set of corresponding management policies, executing a verification action indicated in each one of the corresponding management policies for verifying a compliance of the target data-processing entity with the management policy, executing a target-side remediation action indicated in each violated one of the corresponding target-side management policies which the target data-processing entity is not compliant with, for remedying the non-compliance of the target data-processing entity with the violated target-side management policy, sending an indication of a remediation request for each violated one of the corresponding server-side management policies, which each target data-processing entity is not compliant with, and executing by the server data-processing entity, a corresponding server-side remediation action in

Abstract: Embodiments described herein provide techniques for maintaining consistency in a distributed system (e.g., a distributed secondary storage system). According to one embodiment of the present disclosure, a first set of file system objects included in performing the requested file system operation is identified in response to a request to perform a file system operation. An update intent corresponding to the requested file system operation is inserted into an inode associated with each identified file system object. Each file system object corresponding to the inode is modified as specified by the update intent in that inode. After modifying the file system object corresponding to the inode, the update intent is removed from that inode.

Abstract: A management system may include a reconciliation engine configured to reconcile a first instance of a resource object from a first data provider and a second instance of the resource object from a second data provider to obtain a reconciled resource object, and store the first instance, and second instance, and the reconciled resource object in datasets. The management system may include a context sensitive query engine configured to receive a context-sensitive query including context information identifying a source originally providing context sensitive data associated with a context-sensitive attribute, and retrieve the context sensitive data from one or more of the datasets based on the context information.

Abstract: A selector shape may serve as the background to a configurable composite shape and may include one or more expressions that are evaluated to select between several composite shape definitions via links to the definition. Each selector shape includes an animation expression and a lookup table converter to select an identifier of the composite definition to be loaded and displayed. When the value of the animation expression changes, the value may be matched to the name of a new composite definition using the lookup table, and the new definition may be displayed. The previously-used composite definition may then be marked for removal by a caching system, and removed. These selector shapes also enable the same graphic element to be used in displays designed for different types of display devices, such as display devices having large display screens, standard computer screens and very small display screens.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating identifiers for tuples of recursively defined relations. One of the methods includes selecting one or more of the recursively defined relations to evaluate. Respective keys are computed for each tuple of any new tuples computed during recursive evaluation. For each key that occurs in a cache of keys, obtaining a tuple for the key from the cache and adding the obtained tuple to a new relation. For each key that does not occur in the cache of keys, generating a new identifier for the key, and adding, to a new relation for each key of each tuple of any keys that do not occur in the cache of keys for a relation, a new tuple comprising (1) elements of the tuple and (2) the new identifier for the key.

Abstract: A method in one example implementation includes extracting a plurality of data elements from a record of a data file, tokenizing the data elements into tokens, and storing the tokens in a first tuple of a registration list. The method further includes selecting one of the tokens as a token key for the first tuple, where the token is selected because it occurs less frequently in the registration list than each of the other tokens in the first tuple. In specific embodiments, at least one data element is an expression element having a character pattern matching a predefined expression pattern that represents at least two words and a separator between the words. In other embodiments, at least one data element is a word defined by a character pattern of one or more consecutive essential characters. Other specific embodiments include determining an end of the record by recognizing a predefined delimiter.

Abstract: A system includes a free itemset generation unit to generate a set of free itemsets, each having a frequency in the database greater than or equal to a predetermined threshold value set in advance, a valid rule candidate generation unit to generate rule candidates and store the generated rule candidates, and a rule minimality decision unit to check minimality of each of the generated rule candidates and output the generated rule candidate to an output apparatus when the generated rule candidate is determined to be minimal.

Abstract: A system and method enable the selection of a time range of database records for download from a source database source and for transfer to a recipient database. A specifically bounded time period is selected to limit the number of data records selected for download in a particular action to those records that are individually associated with date time stamp values falling within the specified time period. This limitation of records selected for inclusion in a download process to data records having associations with date time stamps falling within a limited time range reduces a likelihood of overload in transferring data and thereby reduces the incidence of time-outs in the communication of a source database, any intermediary server or software action, and the recipient database in an updating of the recipient database to reflect a current state of the source database.

Abstract: Described herein are techniques for supporting bi-temporal data in a key value cache system. An embodiment provides bi-temporal data as the basic functionality of a key value cache system. An embodiment provides a redesign of the core data structures of a key value cache system, adds bi-temporal data storage in the key value hashing structure, and provides a temporality-aware memory space manager. Embodiments can achieve the same performance as current key value cache systems for regular queries (that is, the queries that only access the current versions of data) while supporting bi-temporal data.

Abstract: A processor selects a first database and a second database from a plurality of databases. The processor determines one or more terms found in the first and second database, wherein each term of the one or more terms includes metadata of a database of the plurality of databases. The processor identifies one or more common terms between the first database and the second database and determines the one or more common terms found in each of a plurality of groups of databases of the plurality of databases, wherein each group of databases corresponds to a number of databases which constitute the group of databases. The processor determines a similarity score between the first database and the second database of the plurality of databases based on the one or more common terms found in each group of databases of the plurality of databases.

Abstract: A computer-implemented method for mining data in a data warehouse may include (1) identifying a parent table in a data warehouse, (2) identifying a child table in the data warehouse that depends from the parent table, (3) generating a rule family including rules based on the parent table and the child table, each of the rules in the rule family correlating a potential value of a field of the parent table with a potential value of a field of the child table, (4) determining a level of support for each rule in the rule family, and (5) evaluating quality of incoming data according to a rule in the rule family based on the determined level of support for the rule. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A data output method includes: generating, by a computer, (n?1) first conditions (n is an integer number of three or more) on a relationship between two data by dividing, in a sequential order, a common element condition in which an attribute of each of n data includes a common element, the attribute of each of the two data including the common element; extracting first data corresponding to each of n data to set the first data as a node under a condition; creating a first graph in which nodes are coupled with links based on the first condition; creating a second graph by repeatedly performing a first process, a second process and a third process; determining candidates of a combination of data from the second graph; and outputting a combination of data satisfying the common element condition from the candidates of a combination of data.

Abstract: A data output method, includes: extracting, by a computer, data satisfying a first condition on one data among a plurality of conditions, from a plurality of data, as a node; creating a first graph by coupling two nodes satisfying a second condition on a relationship between two data among the plurality of conditions with a link; creating a second graph by deleting a node that does not satisfy the second condition from the first graph; determining candidates of data combination in the second graph; and outputting a data combination satisfying the plurality of conditions from the candidates of data combination.

Abstract: In at least one embodiment, a method and a system for determining a set of plans that best match a set of preferences. The method may include receiving into a goal specification interface at least one goal to be accomplished by the set of plans; receiving into a preference engine a pattern that includes preferences; generating a planning problem by using the preference engine; generating a set of plans by at least one planner; and providing the set of plans for selection of one plan to deploy. In a further embodiment, the preferences may be an occurrence or non-occurrence of at least one component, an occurrence of one component over another component, an ordering between at least two components, an existence or non-existence of at least one tag in a final stream, an existence of one tag over another tag in the final stream.

Abstract: A database system is described that includes components for storing time-series data and executing custom, user-defined computational expressions in substantially real-time such that the results can be provided to a user device for display in an interactive user interface. For example, the database system may process stored time-series data in response to requests from a user device. The request may include a start time, an end time, a period, and/or a computational expression. The database system may retrieve the time-series data identified by the computational expression and, for each period, perform the arithmetic operation(s) identified by the computational expression on data values corresponding to times within the start time and the end time. Once all new data values have been generated, the database system may transmit the new data values to the user device for display in the interactive user interface.

Abstract: The present disclosure describes methods, systems, and computer program products for improving frequent itemset mining. One computer-implemented method includes receiving, by operation of a computer system, a dataset of multiple transactions, each of the multiple transactions including one or more items; determining, by operation of the computer system, a ubiquitousness parameter of an item representing a frequency of occurrences of the item in the dataset; filtering, by operation of the computer system, out from the dataset one or more items that have ubiquitousness parameters larger than a ubiquitousness threshold; identifying, by operation of the computer system, one or more association rules that satisfy a confidence constraint based on the filtered dataset; and outputting, by operation of the computer system, the one or more association rules that satisfy the confidence constraint.

Abstract: A method and an apparatus for tiered storage processing of data, and a storage device. The method includes: splitting the migration unit into multiple migration subunits when a migration unit of low-tier disks is migrated to high-tier disks, and detecting a data access frequency of each migration subunit respectively; migrating the migration subunit to the low-tier disk when detecting that the data access frequency of the migration subunit is lower than a set threshold; and combining the multiple migration subunits into the migration unit when detecting that the multiple migration subunits are all migrated to the lower-tier disk. The present invention improves usage of storage media, and controls metadata storage resource consumption effectively.

Abstract: An apparatus comprises a network interface and a processor communicatively coupled to the network interface. The network interface communicates with a database comprising a plurality of columns and a plurality of views. Each view is associated with at least one column of the plurality of columns. The processor receives a request to determine one or more noncompliant views of the database. For each view and each column associated with the view, the processor determines whether the column is associated with a privacy indicator that indicates that the column should be masked and whether the view masks the column. The processor then determines that the view is noncompliant if the view does not mask at least one column that should be masked, and generates a report that indicates whether each view of the database is noncompliant. The network interface communicates the report.

Abstract: A method for calculating a partial risk score for a data object may include identifying a request to calculate a partial risk score for a data object, the request including a partial risk score filter, and the data object being associated with one or more policies. The method may further include for each policy associated with the data object, determining whether characteristics associated with the policy match a parameter in the partial risk score filter, and when the characteristics associated with the policy match information in the partial risk score filter, including a data object risk score associated with the policy in the partial risk score for the data object.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating identifiers for tuples of recursively defined relations. One of the methods includes selecting one or more of the recursively defined relations to evaluate. Respective keys are computed for each tuple of any new tuples computed during recursive evaluation. For each key that occurs in a cache of keys, obtaining a tuple for the key from the cache and adding the obtained tuple to a new relation. For each key that does not occur in the cache of keys, generating a new identifier for the key, and adding, to a new relation for each key of each tuple of any keys that do not occur in the cache of keys for a relation, a new tuple comprising (1) elements of the tuple and (2) the new identifier for the key.

Abstract: A method, an apparatus, a host, and a network system for processing a packet. The method includes receiving, by a physical host through a virtual bridge in the physical host, a network packet sent by a source virtual machine in the physical host, where the network packet carries a source media access control (MAC) address and a target MAC address; obtaining, by the physical host according to the source MAC address and the target MAC address by querying correspondence between each virtual machine MAC address and a security domain, a security domain to which the source virtual machine corresponds and a security domain to which a target virtual machine corresponds; and controlling, by the physical host, the virtual bridge to discard the network packet, when the security domain to which the source virtual machine corresponds is different from a security domain corresponding to the virtual bridge.

Abstract: Embodiments relate to re-writing database query plans, and visualizing such re-written query plans. A query re-write framework includes a query normalization engine in communication with a rule catalog comprising query re-write rules in the form of rule classes. The framework receives as input, a query plan graph to be re-written. Based upon the engine's application of re-write rules from the catalog, the framework produces a re-written query plan graph as output. An interface component of the framework may provide a visualization of the re-written query plan graph as part of a dashboard. A user may access the framework to enable/disable existing rules in the catalog, add new rules to the catalog, and/or control a sequence and a precedence in which rules are applied to re-write the query plan. A user may interact with the visualization of the re-written query plan for purposes of de-bugging, re-write optimization, and/or query development.

Abstract: A novel system, computer readable storage medium and method for creating re-usable queries over complex data including hierarchies, trees and graphs is described. This is achieved by an object-oriented query language, where a class is a logical property of a data item, and inheritance is implication between such properties. Virtual method calls execute all relevant method implementations in most specific classes. Expressions can be multi-valued, thus avoiding the need for naming intermediate results. All constructs closely follow the syntax of mainstream object-oriented languages like Java.