Sciweavers

294 search results - page 14 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
TKDE
2010
251views more  TKDE 2010»
14 years 4 months ago
Exploring Correlated Subspaces for Efficient Query Processing in Sparse Databases
The sparse data is becoming increasingly common and available in many real-life applications. However, relative little attention has been paid to effectively model the sparse data ...
Bin Cui, Jiakui Zhao, Dongqing Yang
SIGMOD
2010
ACM
170views Database» more  SIGMOD 2010»
15 years 2 months ago
Querying data provenance
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
Grigoris Karvounarakis, Zachary G. Ives, Val Tanne...
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 8 days ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
15 years 9 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 4 months ago
Supporting annotations on relations
Annotations play a key role in understanding and curating databases. Annotations may represent comments, descriptions, lineage information, among several others. Annotation manage...
Mohamed Y. Eltabakh, Walid G. Aref, Ahmed K. Elmag...