Sciweavers

126 search results - page 14 / 26
» The Complexity of Acyclic Conjunctive Queries
Sort
View
ADL
2000
Springer
284views Digital Library» more  ADL 2000»
13 years 12 months ago
A Boolean Query Processing with a Result Cache in Mediator Systems
A mediator system is a kind of a meta-search engine that provides a seamlessly integrated search service for diverse search engines (collections). Since collections of a mediator ...
Jae-Heon Cheong, Sang-goo Lee
ADC
1995
Springer
90views Database» more  ADC 1995»
13 years 11 months ago
Computer Supported Query Formulation in an Evolving Context
Even if high-level query languages are used, query formulation may cause problems. This is notably so in case of large and complex application domains. Typical examples of these k...
Arthur H. M. ter Hofstede, Henderik Alex Proper, T...
PODS
2010
ACM
249views Database» more  PODS 2010»
14 years 19 days ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...
PVLDB
2008
121views more  PVLDB 2008»
13 years 7 months ago
Type inference and type checking for queries on execution traces
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
Daniel Deutch, Tova Milo
TIME
2002
IEEE
14 years 13 days ago
Representation and Reasoning with Disjunctive Temporal Constraints
We show the expressiveness provided by a Labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to mana...
María Isabel Alfonso Galipienso, Federico B...