415 search results - page 37 / 83 » Optimal query complexity bounds for finding graphs |
AAAI
2007
13 years 10 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
DEXAW
2010
IEEE
13 years 8 months ago
2010
IEEE
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...