903 search results - page 142 / 181 » Non-well-founded trees in categories |
190
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
We present GPUQP, a relational query engine that employs both CPUs and GPUs (Graphics Processing Units) for in-memory query co-processing. GPUs are commodity processors traditiona...
111
click to vote
PODS
2003
ACM
16 years 2 months ago
2003
ACM
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
115
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
118
click to vote
PODS
2008
ACM
16 years 2 months ago
2008
ACM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
126
Voted
PODS
2008
ACM
16 years 2 months ago
2008
ACM
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...