Sciweavers

237 search results - page 6 / 48
» Efficient Query Processing on the Relational Quadtree
Sort
View
EDBT
2006
ACM
150views Database» more  EDBT 2006»
14 years 8 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos
INFORMATICALT
2008
162views more  INFORMATICALT 2008»
13 years 7 months ago
Vague Rough Set Techniques for Uncertainty Processing in Relational Database Model
Abstract. The study of databases began with the design of efficient storage and data sharing techniques for large amount of data. This paper concerns the processing of imprecision ...
Karan Singh, Samajh Singh Thakur, Mangi Lal
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
14 years 8 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
CIKM
2008
Springer
13 years 9 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 8 months ago
Query Processing for SQL Updates
A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused...
César A. Galindo-Legaria, Stefano Stefani, ...