Abstract: Various embodiments of systems and methods to generate native access plan source code are described herein. In one aspect, a database query is received. A query execution plan, including a parent operator and one or more descendent operators, corresponding to the database query is retrieved. Further, a check is made to determine whether the parent operator and the one or more descendent operators include at least one loop. When both the parent operator and the one or more descendent operators include at least one loop, consume points for the at least one loop are defined. The parent operator and the one or more descendent operators are merged based on consume point types to generate native access plan source code.

Abstract: A method implemented in a data processing system includes receiving a plurality of text strings. A plurality of rules are applied to the text strings. If a condition specified in one of the rules exists in a given text string, one or more attributes are associated to that text string as metadata. One or more of the text strings are selected, using the metadata, as a potential title for the content. A final title is prepared based on the potential title, and the content is published online under the final title.

Abstract: A query is received by a database server from a remote application server. The query is associated with a calculation scenario that defines a data flow model that includes one or more calculation nodes. The calculation nodes each define one or more operations to execute by a calculation engine on the database server. Thereafter, the database server instantiates a runtime model of the calculation scenario by accessing a local settings object stored with the calculation scenario that specifies local settings for the calculation scenario. Subsequently, the database server executes the operations defined by the calculation nodes of the instantiated calculation scenario to result in a responsive data set. The data set can then be provided by the database server to the application server.

Abstract: A method and system for accurately estimating a result size of a Group-By operation in a relational database. The estimate utilizes the probability of union of the columns involved in the operation, as well as the relative cardinality of each column with respect to the other columns in the operation. In addition, the estimate incorporates the use of table filters when indicated such that table filters are applied prior to determining the size of the tables in the operation, as well as including equivalent columns into the list of columns that are a part of the Group-By operation. Accordingly, the estimate of the result size of the operation includes influencing factors that provide an accurate estimation of system memory requirements.

Abstract: A streams manager monitors performance of a streaming application on a physical machine, and determines operators that are underperforming and operators that are overperforming. When the performance needs to be improved, the streams manager automatically modifies the flow graph to deploy one or more operators of the streaming application that are overperforming to a virtual machine in a cloud. Moving the overperforming operators off of the physical machine to a VM leaves additional resources for the underperforming operators that are left on the physical machine to improve performance of the streaming application.

Abstract: Techniques are described for performing filter and project operations. In an embodiment, a set of predicates that specify criteria for filtering results to a query is received. Based on a particular predicate of the set of predicates, a predicate result for at least one portion of a particular column is generated. The predicate result identifies rows within the first column that satisfy the particular predicate. Rows are selected and returned as results to the query based at least in part on the predicate result. In an embodiment, the predicate result is a bitvector where each bit of the bitvector corresponds to a particular row within the particular column and identify whether the particular row satisfies the particular predicate.

Abstract: A system and method for managing and analyzing security requirements in reusable models. At least one functional model, at least one security implementation model, at least one requirement model, and meta models of the models are read by a reader. A correspondence between the functional model, security implementation model, and the requirements model is analyzed, whereby the correspondence indicates that compliance/security/accreditation requirements defined in the requirement model match with security objectives implemented by controls defined by the security implementation model. Next, it is determined whether correspondence is or is not given based on the analysis of the correspondence and then evidence is generated based on the analysis of the correspondence and the determination and the impact of changes is analyzed.

Abstract: A method for the selective utilization of graphics processing unit (GPU) acceleration of database queries in database management is provided. The method includes receiving a database query in a database management system executing in memory of a host computing system. The method also includes estimating a time to complete processing of one or more operations of the database query using GPU accelerated computing in a GPU and also a time to complete processing of the operations using central processor unit (CPU) sequential computing of a CPU. Finally, the method includes routing the operations for processing using GPU accelerated computing if the estimated time to complete processing of the operations using GPU accelerated computing is less than an estimated time to complete processing of the operations using CPU sequential computing, but otherwise routing the operations for processing using CPU sequential computing.

Abstract: A method for the selective utilization of graphics processing unit (GPU) acceleration of database queries in database management is provided. The method includes receiving a database query in a database management system executing in memory of a host computing system. The method also includes estimating a time to complete processing of one or more operations of the database query using GPU accelerated computing in a GPU and also a time to complete processing of the operations using central processor unit (CPU) sequential computing of a CPU. Finally, the method includes routing the operations for processing using GPU accelerated computing if the estimated time to complete processing of the operations using GPU accelerated computing is less than an estimated time to complete processing of the operations using CPU sequential computing, but otherwise routing the operations for processing using CPU sequential computing.

Abstract: A database server receives a query from a remote application server that is associated with a calculation scenario. The calculation scenario defines a data flow model that includes one or more calculation nodes that each define one or more operations to execute on the database server. The database server can be a column-oriented database and at least one of the calculation nodes comprises at least one join operation. Thereafter, the database server instantiates the calculation scenario so that it is optimized by removing one or more join operations and associated branches within the calculation scenario. The database server then executes the operations defined by the calculation nodes of the optimized calculation scenario to result in a responsive data set. The database server then provides the data set to the application server.

Abstract: Techniques for implementing the hybrid execution of continuous and scheduled queries are provided. In some examples, a query engine may be initialized with relational data from at least a first source. For example, the first source may include a database or other system that can provide historical data. Additionally, the query engine may be enabled to provide query results based at least in part on the relational data from at least the first source and streaming data from at least a second source. In some examples, the second source may be a data stream.

Abstract: Methods, systems, and apparatus, including computer program products, for generating query refinements using query components. In general, one aspect features a method that includes the acts of receiving a query comprising a plurality of terms; identifying first and second components of the query, wherein each component comprises one or more of the terms of the query and the components do not share a term from the query, and wherein the first component appears before the second component in the query; determining, for each component, a plurality of different respective component refinements; and combining the component refinements to create a plurality of query refinements for the query, including combining a first component refinement for the first component with a second component refinement for the second component to create a query refinement so that the first component refinement appears before the second component refinement in the query refinement.

Abstract: A community travel booking operation includes a collaborative or common portion or phase during which multiple travelers in a community are permitted to collaboratively search for travel recommendations and select a travel recommendation for the community, as well as an individual portion or phase during which travelers in the community individually purchase, book or otherwise complete individual reservations for the community's selected travel recommendation. By separating the booking operation into collaborative and individual portions or phases, travelers are permitted to collaborate on the selection of a travel recommendation, yet each traveler is then able to complete the booking of their own respective reservation without necessarily having to share personal or payment information with the other travelers in the community.

Abstract: Data loss prevention (DLP) systems may be implemented with collaborative services that may be integrated with or work in coordination with productivity services. Administrators may be enabled to configure DLP policies in the collaborative service to mitigate their organization's information disclosure risks, along with the detection and remediation of sensitive information. Access blocking may be a feature of the DLP system, where provision of access blocking may include determining if a detected action associated with content processed by the collaborative service matches access blocking criteria defined by DIP policy rules. In response to the determination that the action matches at least one access blocking criterion defined by the DLP policy rules, a block access tag associated with the content may be activated, previously defined permissions associated with the content may be ignored or altered, and access to the content may be restricted to a number of predefined users.

Abstract: A method for collaboratively captioning streamed media, the method including: rendering a visual representation of the audio at a first device, receiving segment parameters for a first media segment from the first device, rendering the visual representation of the audio at a second device, the second device different from the first device, and receiving a caption for the first media segment from the second device.

Abstract: A method of refreshing a materialized view includes creating a materialized view based on a first result of a database query executed against a set of tables stored in a database and discovering a set of child storage objects associated with a parent storage object. The method also includes inserting, based on discovering the set of child storage objects, an entry into one or more tables of the set of tables, the entry including a child storage object of the set of child storage objects. The method further includes delaying a refresh of the materialized view until after the entry is inserted into the set of tables and then refreshing the materialized view, which is based on a second result of the database query executed against the set of tables.

Abstract: In a method for document analysis, receiving a request to translate a document, identifying usage information corresponding to the document, wherein the usage information includes information corresponding to a current viewing session of the document and historical usage information corresponding to one or more previous viewing sessions of the document, and determining one or more sections of the document to translate based on the identified usage information corresponding to the document.

Abstract: Software receives a data stream for an application running on a distributed streaming platform over a networked cluster of servers. The software converts the data into a plurality of data tuples structured according to a schema. The software repeatedly emits a plurality of the data tuples as a streaming window, which is separated from other streaming windows by a leading control tuple associated with an ordinal identifier for the streaming window. The streaming window is a sequential sequence of tuples that is associated with a recovery policy. Then the software emits a checkpointing tuple after a plurality of streaming windows. The checkpointing tuple causes checkpointing of an instance of an operator for the application when the checkpointing tuple is received by the instance. Each of the operations is executed by one or more processors in real time or near real time rather than offline.

Abstract: The computer retrieves a list of the data elements contained in a database. The computer performs a static and dynamic analysis on the list to determine which data elements have been active in a static or dynamic Structured Query Language (SQL) statement, then removes active data elements from the list. The computer performs a dependency test to determine which data elements on the list are depended on by data objects not on the list and removes those data elements which are depended on. The computer analyzes application code to extract SQL statements and determine whether data elements on the list are active in application code SQL. Any data elements on the list which are active in application code SQL are removed from the list and the remaining data elements on the list are sorted in descending order based on size.

Abstract: The computer retrieves a list of the data elements contained in a database. The computer performs a static and dynamic analysis on the list to determine which data elements have been active in a static or dynamic Structured Query Language (SQL) statement, then removes active data elements from the list. The computer performs a dependency test to determine which data elements on the list are depended on by data objects not on the list and removes those data elements which are depended on. The computer analyzes application code to extract SQL statements and determine whether data elements on the list are active in application code SQL. Any data elements on the list which are active in application code SQL are removed from the list and the remaining data elements on the list are sorted in descending order based on size.

Abstract: Embodiments of techniques related to optimizing and processing queries are disclosed. In one embodiment, a query to access data of one or more databases is received, and a hybrid access path for accessing the data is generated. Generating the hybrid access path may include determining a plurality of candidate access paths and respective path cost values and selecting, based on the respective path cost values, two or more candidate access paths from the plurality of candidate access paths. Generating the hybrid access path may include generating, based on the two or more candidate access paths, the hybrid access path, the hybrid access path including at least one decision point and a set of options. The at least one decision point of the hybrid access path may indicate a difference between two or more candidate sequences of operations of candidate access paths from the two or more candidate access paths.

Abstract: Embodiments of techniques related to optimizing and processing queries are disclosed. In one embodiment, a query to access data of one or more databases is received, and a hybrid access path for accessing the data is generated. Generating the hybrid access path may include determining a plurality of candidate access paths and respective path cost values and selecting, based on the respective path cost values, two or more candidate access paths from the plurality of candidate access paths. Generating the hybrid access path may include generating, based on the two or more candidate access paths, the hybrid access path, the hybrid access path including at least one decision point and a set of options. The at least one decision point of the hybrid access path may indicate a difference between two or more candidate sequences of operations of candidate access paths from the two or more candidate access paths.

Abstract: A search engine that collects and uses public opinion and geographic location to refine search results. Feedback from users on results from previous searches is collected and used to rank the results of future searches and increase their relevancy to the user.

Abstract: User input including a social network notification symbol followed by a social network tag is detected in association with a social network user interface. The social network tag includes a text keyword that identifies a social network topic within the social network. A subset of social network users within the social network that follow the social network topic identified by the text keyword of the social network tag is determined. A referential third-party social network user notification subset within the social network is defined as the determined subset of social network users within the social network that follow the social network topic. A referential third-party social network notification is published to the defined referential third-party social network user notification subset within the social network. The referential third-party social network notification includes the detected user input that includes the social network notification symbol followed by the social network tag.

Abstract: Continuously blocking query result data for a remote query is provided. Included is: creating a first connection, using a communications network, between a database server and a client. At least one secondary connection is created, using the communications network, between the database server and the client, based on the database server supporting a continuous block fetch protocol. Using the at least one secondary connection, the database server receives at least one cursor-based fetch query. The database server generates continuous blocks of result data, based on the received at least one cursor-based fetch query and sends to the client, using the at least one secondary connection, the continuous blocks of result data.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, that a collapsed definition for a first query that includes the constraint indicates a member node is responsive to the first query. The system may then update a saved query result for the first query using the member node identified during the traversal in accordance with the collapsed definition.

Abstract: Embodiments of the present disclosure help content providers identify popular topics based on Internet search data, as well as to quantify the popularity of content addressing those topics. A computer-implemented method according to one embodiment of the present disclosure comprises receiving search data by a computer system; identifying a category related to at least a portion of the search data; determining, by the computer system and based on the search data, a topic for content associated with the identified category; and determining, by the computer system, a score indicative of a level of popularity for the topic, wherein determining the score is based on the search data and on one or more formats for the content associated with the topic.

Abstract: A query is received by a database server from a remote application server. The query is associated with a calculation scenario that defines a data flow model that includes one or more nodes that each define one or more operations for execution by a calculation engine on the database server. Thereafter, the database server instantiates a runtime model of the calculation scenario based on the nodes of the instantiated calculation scenario. Subsequently, one or more of the nodes are identified as being convertible into a relational database format. These nodes are then used to form a container node. An execution plan of the runtime model of the calculation scenario including the container node is built that is executed by the database server to result in a data set which is provided by the database server to the application server.

Abstract: Described are methods, systems and computer readable media for query task operations based on memory allocation and performance criteria.

Abstract: A method of sending and receiving configurable buckets of communication is disclosed. A request to send a communication from an application executing on a client to an application executing on a server is received. The communication has a first priority. A request to send an additional communication from the application executing on the client to the application executing on the server is received. The additional communication has a second priority. The communication is placed into a bucket of communications based on the communication having the first priority. A determination is made to send the bucket of communications to the application executing on the server. The additional communication is placed into the bucket of communications based on a determination that the bucket of communications is not full. The bucket of communications is sent to the application executing on the server.

Abstract: Methods and systems to process computer readable electronic messages, such as electronic mail messages or e-mail. Methods and system include auto-tagging based on one or more of statistical machine learning based clustering techniques, custom parsers, and crowd-sourced message tagging. Methods and systems further include relevancy determination based on combinations of features, user-configurable hybrid web browser/e-mail client rendering, tabbed rendering, plug-in based local computational features, implied social graph based decision making, and automatic detection of account settings.

Abstract: The computer retrieves a list of the data elements contained in a database. The computer performs a static and dynamic analysis on the list to determine which data elements have been active in a static or dynamic Structured Query Language (SQL) statement, then removes active data elements from the list. The computer performs a dependency test to determine which data elements on the list are depended on by data objects not on the list and removes those data elements which are depended on. The computer analyzes application code to extract SQL statements and determine whether data elements on the list are active in application code SQL. Any data elements on the list which are active in application code SQL are removed from the list and the remaining data elements on the list are sorted in descending order based on size.

Abstract: A system and method for operating a big-data platform that includes at a data analysis platform, receiving discrete client data; storing the client data in a network accessible distributed storage system that includes: storing the client data in a real-time storage system; and merging the client data into a columnar-based distributed archive storage system; receiving a data query request through a query interface; and selectively interfacing with the client data from the real-time storage system and archive storage system according to the query.

Abstract: Techniques for use in connection with generating text, the techniques comprise: obtaining a plurality of items of content and associated metadata; and generating a document plan comprising a plurality of rhetorical relations among items of content in the plurality of items of content, the plurality of rhetorical relations comprising a first set of one or more rhetorical relations and a second set of one or more rhetorical relations different from the first set, the generating comprising: obtaining a schema specifying the first set of one or more rhetorical relations; and identifying the second set of rhetorical relations based, at least in part, on the associated metadata, wherein the second set of rhetorical relations is not in the schema.

Abstract: Questions are received for a conference call. The questions are submitted electronically, such as by email or Instant Messaging (IM). The questions can be submitted before and/or during the conference call. The questions are clustered into one or more similar categories. The clustered questions are sent to participants of a conference. For example, the questions can be sent to a presenter of the conference call as an agenda to follow for a question and answer section of the conference call. Likewise, the questions may also be sent to the conference participants as an agenda of the question and answer section of the conference call. The presenter can discuss the questions with the conference participants based on the categorization of the submitted questions.

Abstract: Disclosed are systems, apparatus, and methods for presenting feed items in an information feed. In various implementations, a first result object is received, where the first result object is a data structure including a result of a feed query, where the result of the feed query includes at least one feed item to be included in the information feed, and where the at least one feed item has a first presentation. In various implementations, at least one custom object associated with the at least one feed item is received, where the at least one custom object provides a second presentation of the at least one feed item. In some implementations, the at least one custom object is included with the first result object to define an intermediary data structure. In some implementations, the intermediary data structure is stored on one or more storage mediums.

Abstract: A streams manager monitors performance of a streaming application on a physical machine, and determines operators that are underperforming and operators that are overperforming. When the performance needs to be improved, the streams manager automatically modifies the flow graph to deploy one or more operators of the streaming application that are overperforming to a virtual machine in a cloud. Moving the overperforming operators off of the physical machine to a VM leaves additional resources for the underperforming operators that are left on the physical machine to improve performance of the streaming application.

Abstract: Implementing a Bloom filter index as a hierarchical data structure. Bloom filters are received and their bit vectors are decomposed into successive bit sequences. For each bit sequence except the last one, memory for at least storing a pointer to a memory location on the next level is allocated on the level corresponding to the bit sequence. The pointer storage is labeled by the value of the next bit sequence. A pointer to the allocated memory is stored in the pointer storage on the previous level that was labeled by the binary value of the current bit sequence. For the last bit sequence, memory for storing Bloom filters is allocated on the last level. A pointer to the allocated memory is stored in the pointer storage on the second-to-last level that was labeled by the value of the last bit sequence. The Bloom filter is stored in the allocated memory.

Abstract: Systems, methods, and software are disclosed herein for implementing enterprise graph search. In at least one implementation, an enterprise search service receives a search request that includes a graph query directed to an enterprise graph. The graph is representative of various objects and actors associated with an enterprise, as well as which of the actors performed which of various actions with respect to each of the various objects. The service searches at least a portion of the enterprise graph to identify a subset of the objects that relate to the actors as defined by the graph query in terms of at least the actors and actions. A reply to the search request may include graph results indicative of the subset of the objects.

Abstract: Provided are techniques for sharing a partitioned data set across parallel applications. Under control of a producing application, a partitioned data set is generated; a descriptor that describes the partitioned data set is generated; and the descriptor is registered in a registry. Under control of a consuming application, the registry is accessed to obtain the descriptor of the partitioned data set; and the descriptor is uses to determine how to process the partitioned data set.

Abstract: Disclosed are various implementations of different methods, apparatus, systems, and computer-readable storage media for providing selective notifications in an online social network. In some implementations, an information update is capable of being stored in a database and capable of being included in an information feed displayed on a display device. One or more notification options is provided in association with the information update. A selection of the one or more notification options can be received. The selected one or more notification options can define one or more conditions for sending a network communication indicating data received in association with the information update. The one or more notification options is stored on a storage medium.

Abstract: A method, system, and a computer program product for querying a database. The system includes: a storage means; a processor communicatively coupled to the storage means; and a feature selection module communicatively coupled to the storage means and the processor, wherein the feature selection module is configured to perform the steps of a method including: storing a database in the storage means, the database including a time field; extracting data in a predetermined period from a current time from the database; sorting the data by the time field; buffering the sorted data in a main memory; receiving a query including time; and outputting the data buffered on the basis of the time field as a stream.

Abstract: A network-based service may be provided for facilitating queries for a number of items, such as travel services. A user may submit a query including criteria for determining one or more relevant items. Based on the submitted query, the network-based service may present the user with information regarding the actions of other similar users of the network-based service, such as searches performed by the other users. Based on this information, the user may elect to supplement the current query to conform to the actions for other users. In some embodiments, actions by other users may be based at least in part on a category of the querying user. By presenting actions of similar users, a current user may be enabled to select the most relevant query terms for identifying a desired item.

Abstract: Allocation within a database environment is performed by processing a sequence of steps, each of which is described by an allocation processing block. The allocation processing block receives three inputs (input tables or input view) and computes a result. Related apparatus, systems, techniques and articles are also described.

Abstract: Techniques for using zone map information for post index access pruning. In one embodiment, for example, a method for using zone map information for post index access pruning comprises: receiving a query statement comprising a first filter predicate on an indexed column of a database table and a second filter predicate on a zoned column of a database table; identifying zero or more pruneable zones of a zone map based on a value for the zoned column in the second filter predicate; obtaining a set of data record addresses from an index on the indexed column based on a value for the indexed column in the first filter predicate; and pruning, from access paths for processing the query statement, any data records, corresponding to data record addresses in the set of data record addresses, that are physically located in one of the pruneable zones.

Abstract: Techniques for partition pruning based on aggregated zone map information. In one embodiment, for example, a method for pruning partitions based on aggregated zone map information comprises: receiving a query statement comprising a filter predicate on a column of a database table; and pruning one or more partitions of the database table from access paths for processing the query statement based on determining, based on aggregated zone map information associated with the one or more partitions, that the filter predicate cannot be satisfied by data stored in the one or more partitions.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating query plans for queries that include common expressions. One of the methods includes receiving an initial query plan generated for a query that includes multiple common expressions; identifying two or more matching subtrees of the initial query plan; generating an alternative query plan that includes a CTE producer operator and having an instance of one of the matching subtrees as one or more descendant operators of the CTE producer operator, including replacing at least one instance of a matching subtree in the initial query plan with a CTE consumer operator corresponding to the CTE producer operator; computing respective costs for the initial query plan and the alternative query plan; selecting the alternative query plan based on the cost for the alternative query plan; and computing a result for the query using the alternative query plan instead of the initial query plan.

Abstract: Embodiments include methods, systems and computer program products for offloading multiple processing operations to an accelerator. Aspects include receiving a database query from an application, performing an analysis on the query, and identifying a plurality of available accelerators. Aspects further include retrieving cost information for one or more templates available on each of the plurality of available accelerators, determining a query execution plan based on the cost information and the analysis on the query, and offloading one or more query operations to at least one of the plurality of accelerators based on the query execution plan.

Abstract: User input including a social network notification symbol followed by a social network tag is detected in association with a social network user interface. The social network tag includes a text keyword that identifies a social network topic within the social network. A subset of social network users within the social network that follow the social network topic identified by the text keyword of the social network tag is determined. A referential third-party social network user notification subset within the social network is defined as the determined subset of social network users within the social network that follow the social network topic. A referential third-party social network notification is published to the defined referential third-party social network user notification subset within the social network. The referential third-party social network notification includes the detected user input that includes the social network notification symbol followed by the social network tag.

Abstract: Methods, systems, and computer-readable storage media for configuring a request-centric system. Implementations include actions of monitoring operation of the request-centric system to determine a workload of the request-centric system, wherein the workload includes a plurality of requests, determining a mapping function based on a utility function, the workload and a configuration, the mapping function mapping the workload and the configuration into the utility function, determining an optimal configuration based on the mapping function, the optimal configuration allocating resources of the request-centric system to achieve one or more predefined goals, and applying the optimal configuration to the request-centric system.