Sciweavers

189 search results - page 31 / 38
» Approximating predicates and expressive queries on probabili...
Sort
View
EDBT
2004
ACM
313views Database» more  EDBT 2004»
14 years 8 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
PVLDB
2010
184views more  PVLDB 2010»
13 years 7 months ago
TimeTrails: A System for Exploring Spatio-Temporal Information in Documents
Spatial and temporal data have become ubiquitous in many application domains such as the Geosciences or life sciences. Sophisticated database management systems are employed to ma...
Jannik Strötgen, Michael Gertz
PODS
2000
ACM
146views Database» more  PODS 2000»
14 years 28 days ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
14 years 1 months ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 3 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...