Sciweavers

311 search results - page 43 / 63
» Approximate XML joins
Sort
View
EDBT
2002
ACM
129views Database» more  EDBT 2002»
15 years 12 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
93
Voted
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 4 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
15 years 12 months ago
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...
Peter A. Boncz, Torsten Grust, Maurice van Keulen,...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 3 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
15 years 12 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...