Sciweavers

272 search results - page 18 / 55
» SQL Queries Over Unstructured Text Databases
Sort
View
IADIS
2009
13 years 4 months ago
Relational databases versus information retrieval systems: A case study
In this paper we present our evaluations of using an Information Retrieval library in a commercial employment website with over 300,000 searches a day. Comparison of existing rela...
Ozgur Yilmazel, Burcu Yurekli, Baris Yilmazel, Ahm...
CIKM
2010
Springer
13 years 5 months ago
Preference query evaluation over expensive attributes
Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them e...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
CIKM
2004
Springer
14 years 4 days ago
Indexing text data under space constraints
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
Bijit Hore, Hakan Hacigümüs, Balakrishna...
ICCS
2005
Springer
14 years 7 days ago
Scalable Hybrid Search on Distributed Databases
We have previously described a hybrid keyword search that combines metadata search with a traditional keyword search over unstructured context data. This hybrid search paradigm pro...
Jungkee Kim, Geoffrey Fox
ICDM
2008
IEEE
130views Data Mining» more  ICDM 2008»
14 years 1 months ago
Text Cube: Computing IR Measures for Multidimensional Text Database Analysis
Since Jim Gray introduced the concept of ”data cube” in 1997, data cube, associated with online analytical processing (OLAP), has become a driving engine in data warehouse ind...
Cindy Xide Lin, Bolin Ding, Jiawei Han, Feida Zhu,...