Abstract: Columnar storage provides many performance and space saving benefits for analytic workloads, but previous mechanisms for handling single row update transactions in column stores suffer from poor performance. A columnar data layout facilitates both low-latency random access capabilities together with high-throughput analytical access capabilities, simplifying Hadoop architectures for use cases involving real-time data. In disclosed embodiments, mutations within a single row are executed atomically across columns and do not necessarily include the entirety of a row. This allows for faster updates without the overhead of reading or rewriting larger columns.

Abstract: The various embodiments of the present invention pertain to a method for operating a system for managing approval requests using email.

Abstract: A cloud-based write-once object store is configured to store inode-based data exported to the store from an enterprise file system. For each version of data (e.g., a file) exported to the store, there is a version of the inode corresponding to that data. As versions of the data are exported to the cloud, the system creates multiple versions of the inode. The set of inode versions corresponding to the versions of the file have a pointer associated therewith that specifies the latest version of the data associated with the inode. The inode versions in the set share the same pointer. The inode versions represent a revision history for the inode. For each inode version corresponding to a version of the data, information is received and stored in a new portion of the object store. The inode version for a file version comprises a list of data chunks for the file.

Abstract: Techniques are provided for autonomous caching of hierarchical data. In one technique, query log data is stored that comprises multiple entries, each entry (a) corresponding to a different instance of a query that was executed against a database and (b) indicating a tuple (or level grouping) comprising a set of hierarchy levels corresponding to a set of dimensions. Multiple tuples indicated in the query log data are identified. For each tuple: (1) a set of entries that indicate the tuple is identified and the set of entries is associated with the tuple; (2) aggregated performance data is generated for the tuple based on performance data associated with each entry in the set of entries that is associated with the tuple; and (3) based on the aggregated performance data, it is determined whether to create a new auto-cache table or to delete an existing auto-cache table associated with the tuple.

Abstract: Systems, methods and computer program products are presented for the automated deployment of a code update to a device. One or more clusters of devices may be connected to a development environment for deployment of one or more code updates through respective development pipelines to the respective clusters of devices. A first cluster of devices receives a module for implementation of an agent for the first cluster of devices and a central queue local to a centralized controller of the development environment. The agent reports at least one status of a respective device to the centralized controller of the development environment, whereby that status may correspond to a code update image pulled onto the respective device. The agent retrieves one or more instruction messages from the centralized controller in response to the reported status of the respective device.

Abstract: A memory device includes an array of 2T1C DRAM cells and a memory controller. The DRAM cells are arranged as a plurality of rows and columns of DRAM cells. The memory controller is internal to the memory device and is coupled to the array of DRAM cells. The memory controller is capable of receiving commands input to the memory device and is responsive to the received commands to control row-major access and column-major access to the array of DRAM cells. In one embodiment, each transistor of a memory cell includes a terminal directly coupled to a storage node of the capacitor. In another embodiment, a first transistor of a memory cell includes a terminal directly coupled to a storage node of the capacitor, and a second transistor of the 2T1C memory cell includes a gate terminal directly coupled to the storage node of the capacitor.

Abstract: One example technique includes receiving a request for accessing a file from a container process. In response to receiving the request, the technique includes querying a mapping table corresponding to the container process to locate an entry corresponding to a file identifier of the requested file. The entry also includes data identifying a file location on the storage device from which the requested file is accessible. The technique further includes retrieving a copy of the requested file according to the file location identified by the data in the located entry in the mapping table and providing the retrieved copy of the requested file to the container process, thereby allowing the container process to access the requested file.

Abstract: A method for decreasing a number of individual entries in a database of user-created records which describe a single item by: receiving a plurality of user-created records, each of said records comprising at least a descriptive string; placing individual ones of the plurality of user-created records having a sufficiently similar descriptive string into one of a plurality of first groups; hashing the descriptive string of each of the plurality of first groups in order to place two or more groups into a single bin; performing a pair-wise comparison of the descriptive strings of the two or more groups in each bin; and when the comparison of the descriptive strings of the two or more groups in a bin results in a distance below a first threshold, merging the two or more groups into a combined group.

Abstract: A method includes receiving network traffic data relating to one or more devices of a plurality of home networks, wherein each home network of the plurality of home networks relates to a respective household. The method further includes determining one or more household related features by feature engineering the network traffic data, wherein the one or more household related features are related to one or more of: a device property, a security threat event, and an application usage, associating, in a database, the one or more household related features with identification data assigned to each household, identifying household clusters that represent groups of households comprising a predetermined number of common household related features, and providing a targeted service to a customer based on a household cluster associated with a household of the customer.

Abstract: A method performed by a processing system includes identifying a first node in a metadata tree of a patient that corresponds to an encrypted electronic health record in an encrypted data store and preventing a portion of the first node from being decrypted with a node key of a first healthcare participant in response to a second node of the metadata tree including key rotation information that indicates that the node key has been revoked by a second healthcare participant.

Abstract: Context and social distance aware fast live people cards are described. A user context and/or a relevant person context may be determined in response to detecting a user interest in viewing contact information. The user context may include user's attributes such as organizational position, preferences, location, working hours, which application the user is employing, etc. Relevant person context may include context information (similar to the user's) for people within a predefined social distance such as the user's peers, supervisor(s), close friends, etc. Information associated with one or more persons of interest to the user may then be selected and retrieved from a cache storage at a server a productivity service to be provided to a client application for display to the user. Information to be stored in server cache for rapid retrieval may also be selected based on user and relevant person context using observed user behavior.

Abstract: The invention provides, in some aspects, a system for rendering images, the system having one or more client digital data processors and a server digital data processor in communications coupling with the one or more client digital data processors, the server digital data processor having one or more graphics processing units. The system additionally comprises a render server module executing on the server digital data processor and in communications coupling with the graphics processing units, where the render server module issues a command in response to a request from a first client digital data processor.

Abstract: A service enables a command that refers to a file system object using a hierarchical namespace identifier to be executed against the file system object in a flat namespace. The service selectively distributes the command to one of a plurality of name resolution nodes based on a directory name included in the hierarchical namespace identifier. The identified node resolves the directory name to a flat namespace identifier that is used to execute the command against the flat namespace. After communicating with at least one storage node to resolve a directory name, each name resolution node stores a mapping of the directory name to the corresponding flat namespace identifier in a cache, so that subsequent resolutions of that directory name may be performed more efficiently. Cache entries may be invalidated when an operation occurs that impacts the relevant mapping and/or based on system considerations such as cache expiry.

Abstract: Embodiments for optimizing file lookups after a file or directory rename operation. Files are defined using inode, dirent, and hash entries, and the name space of the files are stored in a B?Tree using file system conventions in which the inode, dirent, and hash values are referenced by the directory first followed by the inode number, as in a first data structure denoted [directory:inode]. Upon a rename of a file, the old inode, dirent, and hash entries are deleted, and a reference is created to the old name using the inode number first followed by the old directory, as in a second data structure denoted [inode:old_directory], and this reference is used as a forward link to the new file under the new directory name.

Abstract: Some embodiments may be associated with a cloud-based computing environment. A multi-tenant master process platform, associated with a RDBMS, may create a logical database for a tenant on a physical instance of the cloud-based computing environment. A connection to the logical database may be received from a client user associated with the tenant, and a process for the connection may be created. A process identification number created for the process may then be captured along with the database identifier for the tenant using an in-kernel virtual machine program. The system may send the process identification number and the database identifier to a user space program. The user space program creates a control group with the name of the database identifier and places the process identification number into the control group. The control group can then be limited with respect to a maximum amount of resources (memory, CPU etc.).

Abstract: A computer-implemented method is provided for permitting a user to manipulate data feeds via a graphical user interface. The method includes receiving, by a computing device, the data feeds over a communications network in real time from corresponding data sources and receiving from the user, by the computing device, via the graphical user interface an execution plan comprising a list of one or more actions to be performed on the data feeds. The method also includes sequentially executing, by the computing device, each of the actions in the execution plan on the real-time data feeds to generate one or more manipulated data feeds. The method further includes displaying, by the computing device, the manipulated data feeds to the user in a user-defined format via the graphical user interface.

Abstract: An odor analysis system is provided to analyze odors present at a particular location and perform a preliminary identification of the odors while still at the location. The odor analysis system can have an odor processing device that collects samples of the odors and provides a series of odor notes to a user. The odor notes can be based on the separated and concentrated molecules in the collected sample. The odor analysis system can also include a hand-held computing device with a user interface that permits the user to enter information, both verbally and through touch input, about the series of odor notes provided by the odor processing device. The information entered by the user about the series of odor notes along with retention index information about the series of odor notes can be to perform a preliminarily identification of the molecules associated with the odors present at the location.

Abstract: Methods and systems for execution of distributed analytics include building a global linked structure that describes correspondences between dataset metadata structures, analytics metadata structures, and location metadata structures and that encodes compatibility between respective datasets, analytics, and locations. A set of analytics and compatible datasets for execution is determined based on the dataset metadata structures, analytics metadata structures, and global linked structure. An optimal execution location is determined based on the determined set of analytics and compatible datasets, the location metadata structures, and the global linked structure. The set of analytics and compatible datasets are deployed to the optimal location for execution.

Abstract: Disclosed is a system, method, and computer program product to handle unresponsive reader instances in a database system. A timeout-based invalidation and suspension approach is provided that addresses the problem of unresponsive read-only instances.

Abstract: A caseless file lookup in a distributed file system is disclosed. A request to store a file in a volume may be received. In response to the request, the type of client system issuing the request may be identified. Based on the type of client system that has been identified, a first hash value or a second hash value may be calculated for the name of the file to generate and assign a hash value to the file. The file may be stored in a storage resource based on the first or second hash value that has been generated for the file.

Abstract: A web page clustering method and device, used for clustering web pages according to a web page framework, the method including: acquiring uniform resource locators (URL) of a plurality of web pages to be clustered; for the URL of each web page to be clustered, determining rewriting rules of the URL and classifying the URL according to the rewriting rules of the URL; determining a web page framework of the web page corresponding to each URL in each URL class, and determining whether each URL may be clustered according to the web page framework of the web page corresponding to each URL; and retaining the URL class if each URL may be clustered.

Abstract: In one embodiment, a computing device configured to execute a hosted application includes a processor and storage, where an operating system is installed on the computing device, an application platform application including a rendering engine process including a virtual machine and an integration process, at least one hosted application comprising a background page file, wherein the virtual machine is configured to parse instructions in the background page file to download at least one remotely hosted file for rendering a web page, build a document object model (DOM), and modify the DOM in accordance with a predetermined DOM modification rule to create a modified DOM based on the computing environment, and wherein the rendering engine process is configured to render a user interface page integrated into the computing environment of the operating system of the computing device based on the DOM generated by the execution of the background page.

Abstract: Methods and systems for verifying asset identity. The system includes a rules engine executing a corpus of rules to analyze received fingerprint data regarding one or more assets in a network. The rules engine may execute the rules to create a synthetic fingerprint to provide more accurate and helpful information regarding a network asset.

Abstract: An approach for optimizing single-row operations in a data warehouse. Single-row operations are determined based on receiving database operations. Extends identifiers are received based on the single-row operations. Single-row usage statistics are maintained for extends identifiers based on single-row operations. A logical sequence of the extends identifiers in extends lists stores are sorted based on single-row usage statistics and the logical sequence is maintained based on determining further single-row operations.

Abstract: Techniques are described herein for cloning a database. According to some embodiments, a database server receives a request to clone a source database. In response to receiving the request, the database server retrieves a set of one or more storage credentials for a set of one or more respective storage systems on which a set of files of the source database are stored. The set of storage credentials grant permission to the database server to create snapshot copies on the set of storage systems. The database server generates, for a target database using the set of storage credentials, a snapshot copy of each respective file in the set of files of the source database. The snapshot copy of the respective file points to the same set of one or more data blocks as the respective file until at least one of the data blocks is modified.

Abstract: Technologies related to resending hypertext transfer protocol (HTTP) requests are disclosed. One or more operations performed on a first web page is monitored. One or more HTTP requests that include the monitored one or more operations are sent to a server. Information associated with the one or more HTTP requests are recorded. Upon determining that an HTTP request of the one or more HTTP requests has failed to be sent, the HTTP request is recorded to a list of HTTP requests that failed to be sent. The HTTP request recorded to the list is deleted after receiving a normal response message from the server, and whether the list of HTTP requests that failed to be sent is empty is determined when redirecting from the first web page to a second web page.

Abstract: A computer-implemented method is used to transmit data from a first computer to a second computer using a first protocol. The computers belong to first and second computer groups. Inter-group communication is restricted to data packets with first type data. A client module of the first computer provides data packets with first and second type data. An intermediate module receives data packets from the client module and forwards data packets to a modifier module of an auxiliary computer, using a second protocol. The auxiliary computer belongs to the first computer group. The intermediate module receives modified data packets from the modifier module using the second protocol. The packets contain first type data. The intermediate module forwards the modified data packets to a protocol module on the first computer that encodes the modified data packets. The protocol module transmits encoded modified data packets to the second computer, using the first protocol.

Abstract: Examples are disclosed for identifying duplicated media content in a plurality of media files. In some examples, according to a media file format, media content sequences may be located and duplicated media content sequences identified. For these examples, at least a portion of the identified duplicated media content sequences may then be deleted or not stored at a storage system. Other examples are described and claimed.

Abstract: A assimilated economic crime intelligence (AECI) system and method, comprising a first computer device that provides first entity data, and a web sector communicatively coupled to the first computer device. The web sector receives first entity data from the first computer device and sends the first entity data to a case comparator sector that compares the first entity data against second entity data in a database dedicated to a second computer device to determine a degree of matchability, wherein the web sector generates and sends a display signal to the first computer device to display a graphic user interface with the degree of matchability, without sharing the first entity data with the second computer device or the second entity data with the first computer device.

Abstract: A service enables a command that refers to a file system object using a hierarchical namespace identifier to be executed against the file system object in a flat namespace. The service selectively distributes the command to one of a plurality of name resolution nodes based on a directory name included in the hierarchical namespace identifier. The identified node resolves the directory name to a flat namespace identifier that is used to execute the command against the flat namespace. After communicating with at least one storage node to resolve a directory name, each name resolution node stores a mapping of the directory name to the corresponding flat namespace identifier in a cache, so that subsequent resolutions of that directory name may be performed more efficiently. Cache entries may be invalidated when an operation occurs that impacts the relevant mapping and/or based on system considerations such as cache expiry.

Abstract: A computing network may include, in an example, a plurality of media output devices communicatively coupled via the computing network; a tracking module to, when executed by a processor: track a user's emotional connection with a first media output from a first media output device of the plurality of media output devices to calculate an emotional quotient score; track the users's disconnection with the first media output from the first media output device; a connection module to connect the user to a related media output from a second media output device based on the emotional quotient score.

Abstract: A building management system (BMS) includes building equipment, a data collector, a sample aggregator, and an application. The building equipment is operable to monitor and control a variable in the BMS and to provide raw data samples of the variable. The data collector is configured to collect the raw data samples from the building equipment and generate a raw data timeseries including a plurality of the raw data samples. The sample aggregator is configured to automatically generate a data rollup timeseries including a plurality of aggregated data samples. The aggregated data samples are generated by aggregating the raw data samples as the raw data samples are collected from the building equipment. Both timeseries are stored in a timeseries database. The application is configured to retrieve the raw data timeseries and the data rollup timeseries from the timeseries database in response to a request for timeseries data associated with the variable.

Abstract: A method for enabling at least one user interface display field to perform at least one action is provided. The method may include receiving a first user action associated with the at least one user interface display field. The method may further include activating the at least one user interface display field in response to the received first user action. Additionally, the method may include determining a context associated with the activated at least one user interface display field. The method may also include applying the determined context associated with the activated at least one user interface display. The method may further include receiving a second user action associated with the activated at least one user interface display field based on the applied determined context. The method may also include executing the received second user action.

Abstract: A method of operating an electronic device is provided. The method includes selecting at least one particular location in content displayed on a display, identifying text included in the at least one particular location, and executing at least one program based on the text.

Abstract: Context and social distance aware fast live people cards are described. A user context and/or a relevant person context may be determined in response to detecting a user interest in viewing contact information. The user context may include user's attributes such as organizational position, preferences, location, working hours, which application the user is employing, etc. Relevant person context may include context information (similar to the user's) for people within a predefined social distance such as the user's peers, supervisor(s), close friends, etc. Information associated with one or more persons of interest to the user may then be selected and retrieved from a cache storage at a server a productivity service to be provided to a client application for display to the user. Information to be stored in server cache for rapid retrieval may also be selected based on user and relevant person context using observed user behavior.

Abstract: A caseless file lookup in a distributed file system is disclosed. A request to store a file in a volume may be received. In response to the request, the type of client system issuing the request may be identified. Based on the type of client system that has been identified, a first hash value or a second hash value may be calculated for the name of the file to generate and assign a hash value to the file. The file may be stored in a storage resource based on the first or second hash value that has been generated for the file.

Abstract: The present disclosure involves systems, software, and computer implemented methods for database scaling for multi-tenant applications. One example method includes receiving an indication to migrate a tenant of an application from a default database to a scale database. The tenant is locked. At least one stateful component that includes state information for the tenant is identified. The state information is serialized. The identified stateful component(s) are shut down. Data for the tenant is copied from the default database to the scale database. The tenant is assigned to the scale database. The serialized state information is de-serialized to generate de-serialized state information, and the de-serialized state information is stored in the scale database. The stateful component(s) are restarted and the tenant is unlocked.

Abstract: Provided are techniques for storing and retrieving restricted datasets to and from a cloud network with non-restricted datasets. A request to dump datasets from one or more storage devices to the cloud storage is received, wherein the datasets include restricted datasets and non-restricted datasets, and wherein the restricted datasets are in a format that is not supported by the cloud storage. The restricted datasets are identified. The restricted datasets are converted to a format that is supported by the cloud storage to generate converted datasets. The converted datasets and the non-restricted datasets are dumped to one container in the cloud storage.

Abstract: A system for automatically applying retention categories and retention rules to records. The system defines a plurality of retention categories. Each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category. The system receives at least one record. The system automatically associates a retention category of the plurality of retention categories with the at least one record. The at least one record meets the criteria for membership in the associated retention category. The system automatically applies the retention rule of the associated retention category to the at least one record.

Abstract: Embodiments of the invention include a method, system and computer program product for a dynamic Web actions palette. In an embodiment of the invention, a method of dynamically configuring a Web actions palette includes loading text from a message received in a communications program executing in memory of a computer and identifying in the text, a suggestion to perform an action in connection with a Web site remote from the computer. The method also includes generating a network request to perform the action in the Web site and configuring a button to transmit the generated network request and updating a palette of one or more buttons with the configured button for display in the computer. Finally, the method includes displaying the palette in the computer and repeating the loading, identifying, generating, configuring and displaying for additional messages received in the communications program.

Abstract: An approach for optimizing single-row operations in a data warehouse. Single-row operations are determined based on receiving database operations. Extends identifiers are received based on the single-row operations. Single-row usage statistics are stored in extends lists stores where single-row usage statistics include at least one of a hit count and a last hit date. Single-row usage statistics are maintained for extends identifiers based on single-row operations. A logical sequence of the extends identifiers in extends lists stores are sorted based on single-row usage statistics and the logical sequence is maintained based on determining a further single-row operations.

Abstract: In one embodiment, a method of assembling a longitudinal database is provided. The method comprises receiving, using a processor of a data storage unit, medical data streams from a plurality of sources. The medical data streams include patient data related to a plurality of medical events. A first date range that indicates a time span associated with the patient is identified in view of the patient data. The medical events are normalized into a plurality of linking keys based on the first date range. The keys are adapted to longitudinally link each medical event in a sequence of occurrence. Each key of comprises an offset from a start date of the first date range for a corresponding medical event. The medical events are compressed in view of the keys. The compressing generates a location index for each medical event associated with the keys based on a corresponding offset.

Abstract: Techniques are provided for automatic verification of query results obtained from data formatted different from row-major format. Techniques are also provided for automatic triage of query results obtained from data formatted different from row-major format. In an embodiment, the query results may be obtained from querying data formatted in column-major format. In an embodiment, when the query results are determined to be incorrect, a cause of the error in the query results can be automatically identified.

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

Abstract: A method of identifying authentic products versus counterfeit products using tow unique identifier codes is accomplished by providing a first identifier code on the exterior of a product package that identifies the product, the appropriate location for sale, the number of times the code has been scanned and whether or not the product is registered. This information alerts potential purchasers if the product is either counterfeit, or an unauthorized resale. The purchaser then opens the package and is provided a second identifier code for registering the product. The registration information includes retailer and price information, alerting the manufacturer of unauthorized retail activity, and also changes the product designation in the manufacturer database to indicate the product may not be resold. That information is then associated with the first identifier code in the event it is rescanned by another potential purchaser.

Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.

Abstract: Opaque offerings of items conceal at least one attribute of the items from customers, typically a brand associated with the items. Such offerings usually include a generic description of the items and an opaque price that is typically lower than a standard offered price for the items. By identifying customers who may have an interest in such items, and tailoring opaque recommendations of such items to such customers, an online marketplace may increase the likelihood that such items will sell to customers while protecting an owner of a brand of such items from any negative implication or connotation that may be associated with offering such items at substandard prices.

Abstract: According to one embodiment of the present invention, a system for sorting data records generates a plurality of data structures associated with corresponding record fields used to sort the data records, and inserts values of the record fields into the corresponding data structures. Each of the data structures comprises one or more ordered parts, and each inserted value is inserted into a part of the corresponding data structure. Each part of a data structure corresponding to a record field having a sort priority immediately below another record field corresponds to a distinct value inserted into a part of the data structure corresponding to the other record field. The system processes the generated data structures to determine sorted data records. Embodiments of the present invention further include a method and computer program product for sorting data records in substantially the same manners described above.

Abstract: Implementations relate to providing selectable content items in communications. In some implementations, a method includes determining that a user is or will be participating in a communication using a device, the communication including an exchange of information with one or more other users. The method determines a set of one or more content items to be presented on the device for selection by the user, the content items derived from stored content and being related to activity performed by the user using the device or one or more other devices, and where the activity is external to the communication. The method causes a presentation of the set of content items with the device for selection by the user, and causes at least one content item selected by the user to be sent in the communication to at least one of the other users.

Abstract: In one embodiment, a first node in a network receives one or more bitmaps from one or more child nodes of the first node according to a directed acyclic graph (DAG). Each of the one or more child nodes is associated with a corresponding unique bit position in the one or more bitmaps. The first node stores, in a forwarding table, the one or more bitmaps received from the one or more child nodes of the first node. The first node receives a message that includes a destination bitmap that identifies one or more destinations of the message via one or more set bits at bit positions associated with the one or more child nodes. The first node forwards the message towards the identified one or more destinations based on the destination bitmap and the one or more bitmaps stored in the forwarding table of the first node.