Sciweavers

398 search results - page 15 / 80
» Query by output
Sort
View
DASFAA
2008
IEEE
151views Database» more  DASFAA 2008»
14 years 11 months ago
Efficient Top-k Search Across Heterogeneous XML Data Sources
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Rui Zhou
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
15 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
PVLDB
2010
163views more  PVLDB 2010»
14 years 7 months ago
Geospatial Stream Query Processing using Microsoft SQL Server StreamInsight
Microsoft SQL Server spatial libraries contain several components that handle geometrical and geographical data types. With advances in geo-sensing technologies, there has been an...
Seyed Jalal Kazemitabar, Ugur Demiryurek, Mohamed ...
TREC
2007
14 years 10 months ago
Exegy at TREC 2007 Million Query Track
Exegy’s submission for the TREC 2007 million query track consisted of results obtained by running the queries against the raw data, i.e., the data was not indexed. The hardwarea...
Naveen Singla, Ronald S. Indeck
MFCS
2000
Springer
15 years 1 months ago
On the Autoreducibility of Random Sequences
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
Todd Ebert, Heribert Vollmer