Sciweavers

365 search results - page 69 / 73
» Answering Non-Monotonic Queries in Relational Data Exchange
Sort
View
SIGMOD
1997
ACM
180views Database» more  SIGMOD 1997»
15 years 1 months ago
Online Aggregation
Aggregation in traditional database systems is performed in batch mode: a query is submitted, the system processes a large volume of data over a long period of time, and, eventual...
Joseph M. Hellerstein, Peter J. Haas, Helen J. Wan...
WWW
2009
ACM
15 years 10 months ago
Exploiting web search engines to search structured databases
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
Arnd Christian König, Dong Xin, Kaushik Chakr...
CIKM
2009
Springer
15 years 2 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
VLDB
2005
ACM
144views Database» more  VLDB 2005»
15 years 2 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
ICDT
2003
ACM
132views Database» more  ICDT 2003»
15 years 2 months ago
Probabilistic Interval XML
Interest in XML databases has been growing over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose th...
Edward Hung, Lise Getoor, V. S. Subrahmanian