Sciweavers

513 search results - page 50 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
FOCS
1998
IEEE
15 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ICASSP
2011
IEEE
14 years 1 months ago
Exploiting query click logs for utterance domain detection in spoken language understanding
In this paper, we describe methods to exploit search queries mined from search engine query logs to improve domain detection in spoken language understanding. We propose extending...
Dilek Hakkani-Tür, Larry Heck, Gökhan T&...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 9 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
TKDE
2002
111views more  TKDE 2002»
14 years 9 months ago
Query Relaxation by Structure and Semantics for Retrieval of Logical Web Documents
Since WWW encourages hypertext and hypermedia document authoring (e.g. HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperl...
Wen-Syan Li, K. Selçuk Candan, Quoc Vu, Div...
WEBI
2007
Springer
15 years 3 months ago
Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition
There is a critical need to design and develop tools tract away the fundamental complexity of XML-based Web services specifications and toolkits, and provide an elegant, intuitive...
Chaitali Gupta, Rajdeep Bhowmik, Michael R. Head, ...