Sciweavers

9842 search results - page 1439 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
16 years 7 months ago
Rewriting nested XML queries using nested views
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
Nicola Onose, Alin Deutsch, Yannis Papakonstantino...
SIGMOD
2005
ACM
118views Database» more  SIGMOD 2005»
16 years 7 months ago
A survey of data provenance in e-science
Data management is growing in complexity as largescale applications take advantage of the loosely coupled resources brought together by grid middleware and by abundant storage cap...
Yogesh Simmhan, Beth Plale, Dennis Gannon
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
PODS
2007
ACM
119views Database» more  PODS 2007»
16 years 7 months ago
Reasoning about XML update constraints
XML and semi-structured data are now de-facto standards for data exchange, and it is often the case that published or exchanged XML documents have specic restrictions on how they ...
Bogdan Cautis, Serge Abiteboul, Tova Milo
EDBT
2008
ACM
141views Database» more  EDBT 2008»
16 years 7 months ago
Generating Highly Customizable SQL Parsers
Database technology and the Structured Query Language (SQL) have grown enormously in recent years. Applications from different domains have different requirements for using databa...
Gunter Saake, Marko Rosenmüller, Martin Kuhle...
« Prev « First page 1439 / 1969 Last » Next »