Sciweavers

13 search results - page 1 / 3
» A lattice framework for reusing top-k query results
Sort
View
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 8 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
CIKM
2011
Springer
12 years 3 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
IRI
2005
IEEE
13 years 9 months ago
A lattice framework for reusing top-k query results
Abstract)",4th Annual Walter Lincoln Hawkins Research Conference, RPI, November 2005. B. Hill, \Correlated Caching for Correlated Data", 2nd Annual Walter Lincoln Hawkins...
Brandeis Hill
ADBIS
2007
Springer
126views Database» more  ADBIS 2007»
13 years 7 months ago
Optimal Query Mapping in Mobile OLAP
Query mapping to aggregation lattices is used in order to exploit sub-cube dependencies in multidimensional databases. It is employed in mobile OLAP dissemination systems, in order...
Ilias Michalarias, Hans-Joachim Lenz
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 3 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...