Sciweavers

721 search results - page 16 / 145
» Supporting top-k join queries in relational databases
Sort
View
78
Voted
TKDE
2002
127views more  TKDE 2002»
14 years 9 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
97
Voted
WAIM
2010
Springer
14 years 7 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
EDBT
2009
ACM
127views Database» more  EDBT 2009»
15 years 4 months ago
Answering aggregate keyword queries on relational databases using minimal group-bys
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
Bin Zhou 0002, Jian Pei
ICDCIT
2004
Springer
15 years 3 months ago
Querying XML Documents from a Relational Database in the Presence of DTDs
Abstract. Many researchers have investigated the problem of storing and querying XML documents using an RDBMS. Two situations are considered in this approach based on whether or no...
Manjeet Rege, Izabell Caraconcea, Shiyong Lu, Fars...
102
Voted
CIKM
2005
Springer
15 years 3 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis