Sciweavers

705 search results - page 96 / 141
» Approximating Extended Answer Sets
Sort
View
JSYML
2010
107views more  JSYML 2010»
14 years 8 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
PODS
2000
ACM
179views Database» more  PODS 2000»
15 years 2 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
ALT
2000
Springer
15 years 2 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
WWW
2005
ACM
15 years 10 months ago
Improving portlet interoperability through deep annotation
Portlets (i.e. multi-step, user-facing applications to be syndicated within a portal) are currently supported by most portal frameworks. However, there is not yet a definitive ans...
Arantza Irastorza, Jon Iturrioz, Oscar Díaz
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
15 years 10 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou