1042 search results - page 9 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this paper, we present Con...
BTW
2007
Springer
2007
Springer
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
13 years 11 months ago
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...