Sciweavers

2229 search results - page 266 / 446
» The Case for Grounding Databases
Sort
View
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 6 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
PODS
2004
ACM
96views Database» more  PODS 2004»
16 years 6 months ago
Roads, Codes and Spatiotemporal Queries
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
Sandeep Gupta, Swastik Kopparty, Chinya V. Ravisha...
PODS
2004
ACM
98views Database» more  PODS 2004»
16 years 6 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
PODS
2005
ACM
109views Database» more  PODS 2005»
16 years 6 months ago
XPath satisfiability in the presence of DTDs
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
Michael Benedikt, Wenfei Fan, Floris Geerts
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 6 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan