Sciweavers

386 search results - page 25 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
DBSEC
2004
108views Database» more  DBSEC 2004»
13 years 10 months ago
Why Is this User Asking so Many Questions? Explaining Sequences of Queries
A sequence of queries submitted by a database user within a short period of time may have a single, illuminating explanation. In this paper we consider sequences of single-record q...
Aybar C. Acar, Amihai Motro
SIGMOD
2003
ACM
240views Database» more  SIGMOD 2003»
14 years 9 months ago
XRANK: Ranked Keyword Search over XML Documents
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
Lin Guo, Feng Shao, Chavdar Botev, Jayavel Shanmug...
EDBT
2011
ACM
256views Database» more  EDBT 2011»
13 years 16 days ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
ICDE
2011
IEEE
243views Database» more  ICDE 2011»
13 years 22 days ago
Interactive SQL query suggestion: Making databases user-friendly
— SQL is a classical and powerful tool for querying relational databases. However, it is rather hard for inexperienced users to pose SQL queries, as they are required to be proï¬...
Ju Fan, Guoliang Li, Lizhu Zhou
ICDT
2001
ACM
153views Database» more  ICDT 2001»
14 years 1 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...