2859 search results - page 311 / 572 » Querying Complex Structured Databases |
152
click to vote
PVLDB
2010
15 years 5 months ago
2010
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
172
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
297
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
187
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
182
click to vote
CINQ
2004
Springer
16 years 11 hour ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...