6650 search results - page 294 / 1330 » Mutating database queries |
138
click to vote
BTW
2007
Springer
2007
Springer
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
15 years 8 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...
144
click to vote
DEXA
2010
Springer
15 years 4 months ago
2010
Springer
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other...
159
Voted
APIN
2002
15 years 4 months ago
2002
We develop the scheme of indefinite constraint databases using first-order logic as our representation language. When this scheme is instantiated with temporal constraints, the res...
231
click to vote
Book
A set of presentations that cover the book, which includes several topics such as relational database systems such as Relational Databases, Database Design, Object-Based Databases ...
119
click to vote
WEBDB
2004
Springer
15 years 10 months ago
2004
Springer
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.