6355 search results - page 1247 / 1271 » From Logic to Games |
117
click to vote
VLDB
2000
ACM
15 years 5 months ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
121
click to vote
DBPL
1995
Springer
15 years 5 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
129
click to vote
MFCS
1991
Springer
15 years 5 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
134
click to vote
HT
1987
ACM
15 years 5 months ago
1987
ACM
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...
142
click to vote
ASPLOS
2010
ACM
15 years 5 months ago
2010
ACM
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...