785 search results - page 90 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
WWW
2007
ACM
14 years 10 months ago
2007
ACM
People are thirsty for medical information. Existing Web search engines often cannot handle medical search well because they do not consider its special requirements. Often a medi...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
CIKM
2005
Springer
14 years 3 months ago
2005
Springer
The basic relationships to be determined in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering relationships. The containment labeling sc...
EDBT
2006
ACM
14 years 10 months ago
2006
ACM
Abstract. Data stream systems execute a dynamic workload of longrunning and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, window...
DBISP2P
2006
Springer
14 years 1 months ago
2006
Springer
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructur...