2859 search results - page 172 / 572 » Querying Complex Structured Databases |
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
PODS
1994
ACM
14 years 12 days ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
VLDB
1991
ACM
13 years 12 months ago
1991
ACM
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...