Sciweavers

239 search results - page 31 / 48
» Performance of Querying Temporal Attributes in Object-Relati...
Sort
View
EDBT
2010
ACM
206views Database» more  EDBT 2010»
14 years 2 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
WWW
2006
ACM
14 years 8 months ago
Time-dependent semantic similarity measure of queries using historical click-through data
It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of clickthrough data logged by Web search engines, which record the...
Qiankun Zhao, Steven C. H. Hoi, Tie-Yan Liu, Soura...
EDBT
2000
ACM
13 years 11 months ago
Temporal View Self-Maintenance
Warehouse view self-maintenance refers to maintaining materialized views at a data warehouse without accessing source data. Self-maintenance has been studied for nontemporal views...
Jun Yang 0001, Jennifer Widom
DASFAA
2004
IEEE
87views Database» more  DASFAA 2004»
13 years 11 months ago
UB-Tree Based Efficient Predicate Index with Dimension Transform for Pub/Sub System
For event filtering of publish/subscribe system, significant research efforts have been dedicated to techniques based on multiple one-dimensional indexes built on attributes of sub...
Botao Wang, Wang Zhang, Masaru Kitsuregawa