Sciweavers

293 search results - page 47 / 59
» Efficiently Querying Relational Databases Using OWL and SWRL
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 11 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
BMCBI
2008
204views more  BMCBI 2008»
14 years 11 months ago
EST2uni: an open, parallel tool for automated EST analysis and database creation, with a data mining web interface and microarra
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
Javier Forment, Francisco Gilabert Villamón...
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 4 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
CLOUDCOM
2010
Springer
14 years 9 months ago
Voronoi-Based Geospatial Query Processing with MapReduce
Geospatial queries (GQ) have been used in a wide variety of applications such as decision support systems, profile-based marketing, bioinformatics and GIS. Most of the existing qu...
Afsin Akdogan, Ugur Demiryurek, Farnoush Banaei Ka...
VLDB
2001
ACM
153views Database» more  VLDB 2001»
15 years 4 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...