Sciweavers

785 search results - page 27 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
ADC
2008
Springer
143views Database» more  ADC 2008»
13 years 10 months ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
WAIM
2010
Springer
13 years 6 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
ADBIS
2007
Springer
119views Database» more  ADBIS 2007»
14 years 3 months ago
Combining Efficient XML Compression with Query Processing
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
Przemyslaw Skibinski, Jakub Swacha
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 10 months ago
SQL Queries Over Unstructured Text Databases
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...
Alpa Jain, AnHai Doan, Luis Gravano
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 9 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu