Sciweavers

3652 search results - page 280 / 731
» A study of query length
Sort
View
136
Voted
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 7 months ago
How schema independent are schema free query interfaces?
— Real-world databases often have extremely complex schemas. With thousands of entity types and relationships, each with a hundred or so attributes, it is extremely difficult fo...
Arash Termehchy, Marianne Winslett, Yodsawalai Cho...
137
Voted
EDBT
2011
ACM
209views Database» more  EDBT 2011»
14 years 7 months ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...
266
Voted
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 5 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
247
Voted
ICDE
2005
IEEE
101views Database» more  ICDE 2005»
16 years 4 months ago
GPIVOT: Efficient Incremental Maintenance of Complex ROLAP Views
Data warehousing and on-line analytical processing (OLAP) are essential for decision support applications. Common OLAP operations include for example drill down, roll up, pivot an...
Songting Chen, Elke A. Rundensteiner
125
Voted
WWW
2001
ACM
16 years 4 months ago
When experts agree: using non-affiliated experts to rank popular topics
In response to a query a search engine returns a ranked list of documents. If the query is on a popular topic (i.e., it matches many documents) then the returned list is usually t...
Krishna Bharat, George A. Mihaila