Sciweavers

217 search results - page 41 / 44
» An optimization for query answering on ALC database
Sort
View
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 9 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
ICALP
2005
Springer
14 years 3 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ICDE
2003
IEEE
211views Database» more  ICDE 2003»
14 years 11 months ago
Capturing Sensor-Generated Time Series with Quality Guarantees
We are interested in capturing time series generated by small wireless electronic sensors. Battery-operated sensors must avoid heavy use of their wireless radio which is a key cau...
Iosif Lazaridis, Sharad Mehrotra
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
14 years 10 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu