String (computer science)

About: String (computer science) is a research topic. Over the lifetime, 19430 publications have been published within this topic receiving 333247 citations. The topic is also known as: str & s.

Efficient updates in dynamic XML data: from binary string to quaternary string

Abstract: XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more attention. However, all the existing techniques have high update cost, they cannot completely avoid re-labeling in XML updates, and they will increase the label size which will influence the query performance. Thus, in this paper we propose a novel Compact Dynamic Binary String (CDBS) encoding to efficiently process updates. CDBS has two important properties which form the foundations of this paper: (1) CDBS supports that CDBS codes can be inserted between any two consecutive CDBS codes with orders kept and without re-encoding the existing codes; (2) CDBS is orthogonal to specific labeling schemes; thus it can be applied broadly to different labeling schemes or other applications to efficiently process updates. Moreover, because CDBS will encounter the overflow problem, we improve CDBS to Compact Dynamic Quaternary String (CDQS) encoding which can completely avoid re-labeling in XML leaf node updates no matter what the labeling schemes are. Meanwhile, we also discuss how to efficiently process internal node updates. We report the experimental results to show that our CDBS and CDQS are superior to previous approaches to process both leaf node and internal node updates.

Command string parsing

Abstract: When read by a machine, a computer-readable code arrangement medium causes the machine to parse a command string resulting in the execution of the commands. Such a computer-readable code arrangement includes: a command processor code portion for processing at least one command string having a command-name and at least one parameter; at least one parameter-handler code portion associated with the at least one parameter and adapted for processing the at least one parameter; and at least one syntax store for storing a plurality of syntax descriptions for a set of the command strings and for storing associations between the parameters and the parameter-handler code portions. Such a command processor code portion syntax processes the command string using the syntax descriptions and the parameter-handler code portions.

User interface providing automatic generation and ergonomic presentation of keyword search criteria

Abstract: A user interface for querying and displaying records from a database employs a physical metaphor for the process of constructing queries and viewing results. In one embodiment, the search criteria are shown as strings of beads in a three-dimensional scene, each bead representing a criterion and each string representing a different category. For example the criteria, drama, action, suspense, and horror may be included in a category of genre. Criteria are selected to form a query by moving corresponding beads to a query string. User preference profiles can be constructed in the same way. To make the entry of key words possible in such an interface, key words are culled from search results based on frequency of appearance in returned records from a search or based on the frequency with which they are approved.

Compositional program synthesis from natural language and examples

Abstract: Compositionality is a fundamental notion in computation whereby complex abstractions can be constructed from simpler ones, yet this property has so far escaped the paradigm of end-user programming from examples or natural language. Existing approaches restrict end users to only give holistic specifications of tasks, which limits the expressivity and scalability of these approaches to relatively simple programs in very restricted domains. In this paper we propose Compositional Program Synthesis (CPS): an approach in which tasks can be specified in a compositional manner through a combination of natural language and examples. We present a domain-agnostic program synthesis algorithm and demonstrate its application to an expressive string manipulation language. We evaluate our approach on complex tasks from online help forums that are beyond the scope of current state-ofthe-art methods.