Sciweavers

6740 search results - page 124 / 1348
» Querying Databases with Taxonomies
Sort
View
ICDE
2011
IEEE
222views Database» more  ICDE 2011»
14 years 10 months ago
Dynamic prioritization of database queries
— Enterprise database systems handle a variety of diverse query workloads that are of different importance to the business. For example, periodic reporting queries are usually mi...
Sivaramakrishnan Narayanan, Florian Waas
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 6 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
CDB
2004
Springer
158views Database» more  CDB 2004»
15 years 10 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers
WWW
2010
ACM
15 years 6 months ago
Classification-enhanced ranking
Many have speculated that classifying web pages can improve a search engine's ranking of results. Intuitively results should be more relevant when they match the class of a q...
Paul N. Bennett, Krysta Marie Svore, Susan T. Duma...
WWW
2004
ACM
16 years 7 months ago
A query algebra for xml p2p databases
This paper describes a query algebra for queries over XML p2p databases that provides explicit mechanisms for modeling data dissemination, replication constraints, and for capturi...
Carlo Sartiani