Sciweavers

6654 search results - page 26 / 1331
» Querying Faceted Databases
Sort
View
SIGMOD
2002
ACM
172views Database» more  SIGMOD 2002»
14 years 7 months ago
Automating physical database design in a parallel database
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman
PODS
2004
ACM
131views Database» more  PODS 2004»
14 years 7 months ago
On the Decidability of Containment of Recursive Datalog Queries - Preliminary report
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
Piero A. Bonatti
EDBT
2012
ACM
255views Database» more  EDBT 2012»
11 years 10 months ago
Top-k spatial keyword queries on road networks
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
João B. Rocha-Junior, Kjetil Nørv&ar...
SIGIR
2010
ACM
13 years 11 months ago
Metrics for assessing sets of subtopics
To evaluate the diversity of search results, test collections have been developed that identify multiple intents for each query. Intents are the different meanings or facets that...
Filip Radlinski, Martin Szummer, Nick Craswell
TKDE
2008
234views more  TKDE 2008»
13 years 7 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002