Abstract: In embodiments, methods and systems for controlling access to custom objects are provided. These techniques for controlling access to custom objects can enable embodiments to utilize a key for the protection of the security of data that is to remain private while not compromising efficiency of a query. The key for a requested custom object is identified and then used so that only an appropriate portion of a custom entity share table is searched to locate access information. It is then determined whether the user can access at least a portion of the custom object, and the appropriate and allowed data is sent to the user.

Abstract: A multi-player gaming system sensing multiple simultaneous contacts on a surface of a gaming table, differentiating contacts by different players. Privacy controls selectively display private information visible to only one of the players on or near the display surface of the gaming table. The gaming system also detects physical objects placed on the surface of the gaming table, causing wagering game functions or peripheral functions to be performed as a result of the placement of the object on the display surface.

Abstract: Novel wager gaming systems and methods for game license management utilizing a game table connected in a network at a gaming establishment are described. A game table having multiple player stations, equipped with gaming devices, performs as a local licensing server for the player stations at the game table. It may also function as a licensing server for player stations at other game tables and for gaming machines in the network. The wager game table may be connected to a central licensing server with operates in conjunction with the wager game table. A player station may also have certain license management components that may complement the operations of a game table license management module. The game table may perform certain local licensing and auditing functions for each player station with regard to wager game code and other game-related content and operational software. The management module may also monitor the usage of various types of wager game code, related content, and game-related software. These usage data are maintained by the game table and may be used for auditing purposes.

Abstract: A system for managing data includes providing at least one logical device having a table of information that maps sections of the logical device to sections of at least two storage areas. Characteristics of data associated with at least one section of the logical device may be evaluated. The at least one section of the data may moved between the at least two storage areas according to a policy and based on the characteristics of the data. The table of information is updated according to the movement of data between the at least two storage areas.

Abstract: The use of any modern computer system leaves unintended traces of expired data and remnants of users' past activities. In this paper, we investigate the unintended persistence of data stored in database systems. This data can be recovered by forensic analysis, and it poses a threat to privacy. First, we show how data remnants are preserved in database table storage, the transaction log, indexes, and other system components. Our evaluation of several real database systems reveals that deleted data is not securely removed from database storage and that users have little control over the persistence of deleted data. Second, we address the problem of unintended data retention by proposing a set of system transparency criteria: data retention should be avoided when possible, evident to users when it cannot be avoided, and bounded in time. Third, we propose specific techniques for secure record deletion and log expunction that increase the transparency of database systems, making them more resistant to forensic analysis.

Abstract: A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future access to the same, overlapping or even disjoint data. This way, a cracking DBMS self-organizes and adapts itself to the workload. So far, cracking has been considered for static databases only. In this paper, we introduce several novel algorithms for high-volume insertions, deletions and updates against a cracked database. We show that the nice performance properties of a cracked database can be maintained in a dynamic environment where updates interleave with queries. Our algorithms comply with the cracking philosophy, i.e., a table is informed on pending insertions and deletions, but only when the relevant data is needed for query processing just enough pending update actions are applied. We discuss details of our implementation in the context of an open-source DBMS and we show through a detailed experimental evaluation that our algorithms always manage to keep the cost of querying a cracked datastore with pending updates lower than the non-cracked case.

Abstract: Various techniques are disclosed for facilitating player tracking activities and/or player rating activities at a casino gaming table. One aspect is directed to different techniques for automatically starting, suspending, resuming and/or ending player tracking sessions at one or more table games. Another aspect is directed to different techniques for automatically starting, suspending, resuming and/or ending player rating sessions at one or more table games.

Abstract: A network switching device includes multiple ports, multiple switching processors, and a table manager. The switching processors respectively have an address table, a output port specification module, an update requirement determination module, and a table update module. The output port specification module refers to a destination address in received data and the address table and specifies a output port for sending the data among the multiple ports. The update requirement determination module determines requirement for update of the address table with regard to a source address in the data. The table manager has an update detail acquisition module and an update request module. Upon determination of the requirement for update of the address table, the update detail acquisition module obtains an update detail of the address table from one of the switching processors. The update request module sends an update request to the switching processors, based on the update detail.

Abstract: The present invention involves a computer system and method which implements a marketing management system. The computer comprises a processor, at least one database containing marketing information, and a database segmentation manager the segmentation manager is coupled to the processor and database. The database segmentation manager includes a node organizer for maintaining concatenated nodes defining a subset of data from the database. The node organizer includes a dataset node for creating a subset of said database according to query criteria and creating a temp table storing a portion of the fields and rows obtained by the query criteria. The segmentation manager further includes universe display software enabling an external user to view the database and nodes. The computer further has a graphic workflow manager capable of providing a visual representation with a plurality of items from the database and having a place and an order of a plurality of work tasks relating to the database.

Abstract: In many applications it is important to find a meaningful relationship between the schemas of a source and target database. This relationship is expressed in terms of declarative logical expressions called schema mappings. The more successful previous solutions have relied on inputs such as simple element correspondences between schemas in addition to local schema constraints such as keys and referential integrity. In this paper, we investigate the use of an alternate source of information about schemas, namely the presumed presence of semantics for each table, expressed in terms of a conceptual model (CM) associated with it. Our approach first compiles each CM into a graph and represents each table's semantics as a subtree in it. We then develop algorithms for discovering subgraphs that are plausible connections between those concepts/nodes in the CM graph that have attributes participating in element correspondences. A conceptual mapping candidate is now a pair of source and target subgraphs which are semantically similar. At the end, these are converted to expressions at the database level. We offer experimental results demonstrating that, for test cases of non-trivial mapping expressions involving schemas from a number of domains, the "semantic" approach outperforms the traditional technique in terms of recall and especially precision.

Abstract: Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of the difficulties of modifying fundamental assumptions in the low- level design of a database system and in the expectations of customers, both of which have developed in an environment that does not support bitmap indexes. Another problem that arises, and one that may more easily be addressed by a research article, is that there is no definitive design for bitmap indexes; bitmap index designs in Oracle, Sybase IQ, Vertica and MODEL 204 are idiosyncratic, and some of them were designed for older machine architectures. To investigate an efficient design on modern processors, this paper provides details of the Set Query benchmark and a comparison of two research implementations of bitmap indexes. One, called RIDBit, uses the N-ary storage model to organize table rows, and implements a strategy that gracefully switches between the well-known B-tree RID-list structure and a bitmap structure. The other, called FastBit is based on vertical organization of the table data, where all columns are individually stored. It implements a compressed bitmap index, with a linear organization of the bitmaps to optimize disk accesses. Through this comparison, we evaluate the pros and cons of various design choices. Our analysis adds a number of subtleties to the conventional indexing wisdom commonly quoted in the database community.

Abstract: Interactive gaming tables are provided that include one or more video displays. The interactive gaming tables are operable to detect and distinguish between various types of physical objects placed on the interactive gaming table, associate a function with at least one type of physical object and generate a video display window on a video display that is viewable through a transparent portion of the one type of physical object. Video images including content associated with the function can be provided in the video display window. The interactive gaming tables can be used to provide a wager-based table game where the function associated with one of the physical objects can be a function related to play of the wager-based table game or a function related to a particular player playing the wager-based game. A mostly transparent, credit-card sized object designed to be carried by a game player is one example of one type of physical object that can be utilized with the interactive gaming table.

Abstract: Techniques for intersystem Single Sign-On use intersystem user ID mapping to map user IDs of multiple systems. In one implementation, a method obtains a user's ID information associated with a first system, and obtains the user's ID information associated with a second system from the user's ID information associated with the first system according to the intersystem user ID mapping table. The first system sends the user's ID information associated with the second system to the second system, which may allow the user to automatically log on upon successful user ID verification. The user ID information communicated between the systems may be encrypted and decrypted using digital signature techniques. Systems for accomplishing the method are also provided.

Abstract: A method for organizing a storage system that is scalable and fault tolerant, the method including grouping together a number D of storage elements to form the storage system, where D is more than one, constructing a storage assignment table that includes table entries, computing, for each of the storage elements, an available capacity that depends on constraints on the placement of redundant data within the storage system, summing the available capacities to form a total available capacity for the storage system; and assigning the table entries in the storage assignment table to each identify one of the storage elements, wherein the available capacity of each of the storage elements is its effective storage capacity when used as part of the storage system, wherein not all of the D storage elements that form the storage system have the same available capacity, and wherein the fraction of all table entries that identify a one of the storage elements depends upon its fraction of the total available capacity.

Abstract: In this paper, we describe the design and implementation of Teaching Table -- an interactive tabletop audio-visual device aimed at enhancing the learning experience for pre-kindergarten children by involving them in physical activities. Using electromagnetic sensing technology, the table can track tagged objects placed on its surface, accurately identifying their type and location while providing a coincident visual display and audio feedback. Teaching activities that are aimed at developing early math skills have been created for the table in alignment with standard curriculum guidelines for pre-K schools. Additionally, we include software based assessment tools for mentors/teachers to easily track an individual child's progress during the process of interacting with the table.

Abstract: Multiple Network Attached Storage (NAS) appliances are pooled together by a virtual NAS translator, forming one common name space visible to clients. Clients send messages to the virtual NAS translator with a file name and a virtual handle of the parent directory that are concatenated to a full file-path name and compressed by a cryptographic hash function to generate a hashed-name key. The hashed-name key is matched to a storage key in a table. The full file-path name is not stored, reducing the table size. A unique entry number is returned to the client as the virtual file handle that is also stored in another table with one or more native file handles, allowing virtual handles to be translated to native handles that the NAS appliance servers use to retrieve files. File movement among NAS servers alters native file handles but not virtual handles, hiding NAS details from clients.

Abstract: In an example implementation, a bifurcated security scheme has a first level that does not allow usage of negations and a second level that does permit usage of negations. In another example implementation, an authorization query table maps respective resource-specific operations to respective associated authorization queries. In yet another example implementation, authorization queries are permitted to have negations, but individual assertions are not.

Abstract: At least a portion of a media file can be downloaded by accessing one or more items of media data associated with a media file stored on a remote server, wherein the media data includes at least one sample table; receiving input from a user identifying a playback location associated with the media file; determining a plurality of data items required to play at least a portion of the media file from the identified playback location based on the at least one sample table; and transmitting one or more byte-range requests to the remote server using the hypertext transfer protocol to retrieve the plurality of data items. Further, the media file can be progressively downloaded from the identified playback location until the end of the media file is reached, playback of the media file is terminated, or input is received from the user identifying a new playback location.

Abstract: "When everything fails, ask for additional domain knowledge" is the current motto of machine learning. Therefore, assessing the real added value of prior/domain knowledge is a both deep and practical question. Most commercial data mining programs accept data pre-formatted as a table, each example being encoded as a fixed set of features. Is it worth spending time engineering elaborate features incorporating domain knowledge and/or designing ad hoc algorithms? Or else, can off-the-shelf programs working on simple features encoding the raw data without much domain knowledge do as well or better than skilled data analysts? To answer these questions, we organized a challenge for IJCNN 2007. The participants were allowed to compete in two tracks: The "prior knowledge" (PK) track, for which they had access to the original raw data representation and as much knowledge as possible about the data, and the "agnostic learning" (AL) track for which they were forced to use data pre-formatted as a table with dummy features. The AL vs. PK challenge Web site remains open: http://www.agnostic.inf.ethz.ch/.

Abstract: Decision support (DSS) workloads generally contain multiple large concurrent scan operations. These are often executed as relational table scans which can take up a lot of I/O bandwidth. This is especially true for ad-hoc queries where the workload is not known in advance. Common database management systems have only limited ability to reuse memory buffer content across multiple running queries due to their treatment of queries in isolation. Previous attempts to coordinate scans for better buffer reuse were less than satisfactory due to drifting between scans and the required radical DBMS architecture changes. In this paper, we describe a new mechanism to keep similar table scans closer together during scanning. This is achieved via dynamic grouping and regrouping of scans based on their runtime behavior and via adaptive throttling of scan speeds based on scan group characteristics. The required memory footprint is very small and the effort required to extend existing database management systems is minimal, as shown in our DB2 UDB prototype. Our experiments show significant gains in end-to-end response times as well as average response times for TPC-H workloads.

Abstract: Embodiments of the invention provide application development tools that allow developers to rapidly build database-aware applications and database unit tests. Embodiments of the invention support multiple scenarios for database-aware application development, including beginning from a database table and automatically creating application code to access the table, beginning from an existing database query, beginning from existing application code that accesses a database, and hybrids or variations of these approaches.

Abstract: Techniques for implementing secure normal forms are provided. In one embodiment, in response to a request for data from a client, a database server is operable to enforce a column-level security policy that is defined for a particular column of some, but not necessarily all, rows of a table stored in a database. After retrieving a set of rows from the table and before returning a result set of rows to the client, the database server modifies the retrieved set of rows into the result set of rows by applying the security policy to each row of the retrieved set of rows, where applying the security policy to a row comprises: determining whether the security policy is satisfied for the particular column of that row; replacing, in the result set of rows, a data value in the particular column of that row with a security-NULL value when the security policy is not satisfied; and including the data value in the particular column of that row into the result set of rows when the security policy is satisfied. After generating the result set of rows, the database server returns the result set of rows to the client.

Abstract: A technique for making versions of rows of a user-defined tracked table temporally queryable. The database management system of the technique permits temporal queries of user-defined tables. The queries return versions of rows in the user-defined table that are currently in an undo log maintained by the database system. Associated with the tracked table are a system history table which contains versions of the rows and temporal metadata indicating when the versions were in the tracked table and a system form history table which contains versions of the form of the tracked table and metadata indicating when the tracked table had the form. These tables are created and maintained by a background process in the database management system. A temporal query on the tracked table combines results from the undo log with results from the system history table. The results' form is determined by the system form history table.

Abstract: PROBLEM TO BE SOLVED: To provide a virtual machine system that can determine appropriate migration destination servers independently of the type of a VMM and reduce the downtime of a VM due to conversion. SOLUTION: A management server 300 for issuing commands to manage servers where the VMM runs stores in advance a conversion time table 371 recording conversion time, a downtime table 372 recording how long the VM stops for migration, a penalty table 373 used for evaluating hardware configuration differences, and a conversion table 375 recording software necessary for conversion. The management server determines an appropriate destination server by using an evaluation value calculated from the tables and information collected from servers 100 and 200 in consideration of CPU utilization, memory usage and migration time. COPYRIGHT: (C)2008,JPO&INPIT

Abstract: System(s) and method(s) facilitate improved performance for insert/update query requests in a database. A lazy updating based on delaying updates of newly inserted records combined with a master-staging partitioning scheme avoid deterioration of performance arising from updating indexes related to new records inserted in a database. Table partitioning as well as partitioning of indexes associated with the table allow new records to reside in manageable sections of memory for pre-configured periods of times prior to being updated. To avoid deterioration of performance associated with increasing size of table/index partitions, the size is maintained below specific thresholds that can be determined based on query workload and other historical data. Deployment of partitions among file systems and design of update delay times can further increase performance of lazy updating.

Abstract: Certain embodiments provide systems and methods for additional table game wagering. Certain embodiments provide a method for table game wagering including allowing a player place a wager on an outcome of a table game, monitoring the performance of the play of said table game and awarding a prize based on said wager upon occurrence of the outcome. Certain embodiments provide a system including a terminal allowing a player to place a wager on a table game outcome, a device for determining an outcome of the table game and a processor for resolving the table game wager.

Abstract: The invention discloses a database synchronization method, in which a synchronous table comprising a synchronous identification numbers and SQL statements is adopted to realize the data synchronization, a database synchronization system is disclosed also, which comprises a primary server having a backup unit, a synchronous table unit and a backup server having a request unit, an acquisition unit and a synchronization unit. The method and system realizes the synchronization of the database and simplifies the modification of the server configuration by use of a synchronous table, thereby the database can be implemented without the restriction of the operation system and the database system which results in an improved efficiency.