Patent application number | Description | Published |
20100042982 | OPTIMIZATION OF IMPERATIVE IMPLEMENTATION OF COMPOSITIONAL CONTENT - Compositional program content is compiled to statements of an imperative application interface in manners that optimize execution and/or resource utilization, among other things. In one instance, a constructor is employed in a manner that obviates a need for extensive memory allocation and parameter copying. Names and namespaces are also cached to avoid expensive table lookup, and redundant namespace declarations are removed and/or moved statically and/or dynamically. | 02-18-2010 |
20120109892 | PARTITIONING ONLINE DATABASES - The present invention extends to methods, systems, and computer program products for partitioning online databases. Online database operations, such as, for example, SPLIT, MERGE, and DROP, are used to alter the arrangement of partitions in a federated database. A SPLIT operation splits rows at one partition across a plurality of other partitions. A MERGE operation merges rows at a plurality of partitions in to one partition. A DROP operation shifts responsibility for rows of data from one partition to another partition and then drops the rows from the one partition. | 05-03-2012 |
20120109926 | SCOPED DATABASE CONNECTIONS - The present invention extends to methods, systems, and computer program products for scoping the context used to access a database partition. Embodiments of the invention enable data isolation using partitions in multi-tenant databases, while relieving client applications from dealing with the partitions. For example, a computer system that includes a distributed database system comprising a plurality of database partitions in a federation receives a context to use when performing database access operations within the distributed database system. The context identifies specified relevant portion of the federation. The computer system also receives a database access operation that is associated with the context. The computer system modifies the semantics of the database access operation in accordance with the associated context, to direct application of the database access operation to the specified relevant portion of the federation. | 05-03-2012 |
20140344221 | PARTITIONING ONLINE DATABASES - Methods, systems, and computer program products are provided for partitioning online databases. Online database operations, such as, for example, SPLIT, MERGE, and DROP, are used to alter the arrangement of partitions in a federated database. A SPLIT operation splits rows at one partition across a plurality of other partitions. A MERGE operation merges rows at a plurality of partitions in to one partition. A DROP operation shifts responsibility for rows of data from one partition to another partition and then drops the rows from the one partition. | 11-20-2014 |
Patent application number | Description | Published |
20090037876 | VISIBLE WHITE SPACE IN PROGRAM CODE - White space is made visible in a code editor to facilitate identification thereof via color, symbols, characters and/or the like. Further, white space can be explicitly identified and distinctly presented of various types including significant, insignificant and editor introduced. White space information can also be employed to aid code compilation and/or processing. | 02-05-2009 |
20110202667 | Database Virtualization - Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database. | 08-18-2011 |
20140150076 | Database Virtualization - Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database. | 05-29-2014 |
Patent application number | Description | Published |
20090006429 | STREAMLINED DECLARATIVE PARSING - Programming mechanisms for data parsing facilitate both clear code specification and efficient execution. Declarative style code can be employed to enable clear and concise specification of data parsing. Further, an efficient parsing approach can be utilized that enables processing of a data structure without first materializing the entire structure to memory. More specifically, streaming and/or selective materialization of portions of data to memory can be employed. | 01-01-2009 |
20090006450 | MEMORY EFFICIENT DATA PROCESSING - Memory efficient data processing is provided in a computer environment. A data representation or description is utilized to reduce memory footprint. A data structure can be serialized iteratively utilizing the representation rather than first loading the entire data structure to memory. Portions of the data structure can be materialized to and removed from memory as function of operational need. | 01-01-2009 |
20090030869 | VISUALIZATION TECHNIQUES FOR IMPRECISE STATEMENT COMPLETION - When a user enters text into an application, the application can utilize an auto-complete feature to provide the user with estimations as to a complete term a user is attempting to enter into the application. Visualization can be provided along with an estimation to disclose the likelihood the estimation is what the user intends to enter. Furthermore, a rationale can be provided to the user for the reason an estimation was provided to the user. | 01-29-2009 |
20090030902 | SCHEMATIZED DATA INTELLIGENT ASSISTANCE FOR DEVELOPMENT ENVIRONMENTS - Intelligent assistance functionality is provided in development environments and/or other editors for schematized data. Input of a trigger character sequence can initiate an intelligent assistance box having data corresponding to a related schema. Thus, the intelligent assistance data can be dynamic as schematized data can change; the data can be queried from the schema as requested to facilitate this end. In one embodiment, the data can be an extensible markup language (XML) schema having a plurality of elements. In this regard, syntax can be entered into a development environment to effectuate an intelligent assistance box comprising the elements of the schema; a root level element can be displayed for an initial trigger character sequence. After selecting the element, another trigger sequence can be input to facilitate querying the schema for next level elements, and so on. | 01-29-2009 |