Sciweavers

311 search results - page 47 / 63
» Approximate XML joins
Sort
View
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
16 years 1 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
POPL
2007
ACM
16 years 7 hour ago
Scrap your boilerplate with XPath-like combinators
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
Ralf Lämmel
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
15 years 12 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
15 years 12 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
PODS
2005
ACM
109views Database» more  PODS 2005»
15 years 11 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