Sciweavers

3368 search results - page 11 / 674
» The Complexity of Query Reliability
Sort
View
PLANX
2008
15 years 3 months ago
Complexity of Earliest Query Answering with Streaming Tree Automata
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
16 years 2 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
EDBT
2002
ACM
179views Database» more  EDBT 2002»
16 years 2 months ago
Efficient Complex Query Support for Multiversion XML Documents
Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML ...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo,...
VLDB
2001
ACM
92views Database» more  VLDB 2001»
15 years 6 months ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...
142
Voted
SIGMOD
2000
ACM
161views Database» more  SIGMOD 2000»
15 years 6 months ago
Answering Complex SQL Queries Using Automatic Summary Tables
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
Markos Zaharioudakis, Roberta Cochrane, George Lap...