Sciweavers

4850 search results - page 580 / 970
» Approximate Data Structures with Applications
Sort
View
ASPLOS
2011
ACM
14 years 10 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
CIKM
2010
Springer
15 years 1 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
ESWS
2010
Springer
15 years 11 months ago
Replication and Versioning of Partial RDF Graphs
The sizes of datasets available as RDF (e.g., as part of the Linked Data cloud) are increasing continuously. For instance, the recent DBpedia version consists of nearly 500 million...
Bernhard Schandl
NGITS
1993
Springer
15 years 11 months ago
AMOS - An Architecture for Active Mediators
AMOS (Active Mediators Object System) is an architecture to model, locate, search, combine, update, and monitor data in information systems with many work stations connected using...
Gustav Fahl, Tore Risch, Martin Sköld
PODS
2008
ACM
204views Database» more  PODS 2008»
16 years 7 months ago
Annotated XML: queries and provenance
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...
J. Nathan Foster, Todd J. Green, Val Tannen