Sciweavers

2237 search results - page 189 / 448
» Storing information with extractors
Sort
View
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 10 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
VLDB
1997
ACM
165views Database» more  VLDB 1997»
15 years 10 months ago
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural...
Roy Goldman, Jennifer Widom
PDIS
1994
IEEE
15 years 10 months ago
Fault-Tolerant Distributed Garbage Collection in a Client-Server Object-Oriented Database
We present a scalable garbage collection scheme for systems that store objects at multiple servers while clients run transactions on locally cached copies of objects. It is the fi...
Umesh Maheshwari, Barbara Liskov
MM
1993
ACM
126views Multimedia» more  MM 1993»
15 years 10 months ago
Phoneshell: The Telephone as Computer Terminal
This paper describes Phoneshell, a telephone based application providing remote voice access to personal desktop databases such as voice mail, email, calendar, and rolodex. Severa...
Chris Schmandt
PLDI
1994
ACM
15 years 10 months ago
On Slicing Programs with Jump Statements
Programslices have potentialuses in manysoftware engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump st...
Hiralal Agrawal