Sciweavers

778 search results - page 69 / 156
» Modelling a Query Space Using Associations
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 2 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
16 years 3 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
WSNA
2003
ACM
15 years 7 months ago
Cleaning and querying noisy sensors
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
Eiman Elnahrawy, Badri Nath
SDB
1995
178views Database» more  SDB 1995»
15 years 5 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
123
Voted
BMCBI
2008
121views more  BMCBI 2008»
15 years 2 months ago
Microarray data mining using landmark gene-guided clustering
Background: Clustering is a popular data exploration technique widely used in microarray data analysis. Most conventional clustering algorithms, however, generate only one set of ...
Pankaj Chopra, Jaewoo Kang, Jiong Yang, HyungJun C...