Sciweavers

929 search results - page 82 / 186
» Answering imprecise database queries: a novel approach
Sort
View
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
16 years 6 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
16 years 6 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
AAAI
2008
15 years 8 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
ICDT
1990
ACM
110views Database» more  ICDT 1990»
15 years 10 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass
ICDE
2007
IEEE
110views Database» more  ICDE 2007»
16 years 7 months ago
Invalidation Clues for Database Scalability Services
For their scalability needs, data-intensive Web applications can use a Database Scalability Service (DBSS), which caches applications' query results and answers queries on th...
Amit Manjhi, Phillip B. Gibbons, Anastassia Ailama...