6740 search results - page 105 / 1348 » Querying Databases with Taxonomies |
133
click to vote
ICDE
2009
IEEE
15 years 8 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
132
click to vote
CAISE
2005
Springer
15 years 7 months ago
2005
Springer
In vague queries, a user enters a value that represents some real world object and expects as the result the set of database values that represent this real world object even with ...
109
click to vote
IDEAS
1999
IEEE
15 years 6 months ago
1999
IEEE
The number of documents published via WWW in form of SGML/HTML has been rapidly growing for years. Efficient, declarative access mechanisms for this type of documents
193
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
A common criticism of database systems is that they are hard to query for users uncomfortable with a formal query language. To address this problem, form-based interfaces and keyw...
106
click to vote
SARA
2007
Springer
15 years 8 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...