Sciweavers

237 search results - page 12 / 48
» Efficient Query Processing on the Relational Quadtree
Sort
View
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
14 years 9 months ago
Progressive Keyword Search in Relational Databases
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
VLDB
2002
ACM
98views Database» more  VLDB 2002»
13 years 7 months ago
Processing Star Queries on Hierarchically-Clustered Fact Tables
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
Nikos Karayannidis, Aris Tsois, Timos K. Sellis, R...
SIGIR
2008
ACM
13 years 7 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 7 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
ICDE
2005
IEEE
160views Database» more  ICDE 2005»
14 years 1 months ago
NXS: Native XML processing in Sybase RDBMS
Sybase's flagship database product, Adaptive Server Enterprise provides Native XML processing (NXS) support. In this paper we present our experience related to query processi...
Anupam Singh, Srikanth Sampath, Vadiraja Bhatt, Fr...