Sciweavers

857 search results - page 41 / 172
» Efficient recursive XML query processing using relational da...
Sort
View
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 6 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
ISPAN
2002
IEEE
15 years 8 months ago
Parallel Selection Query Processing Involving Index in Parallel Database Systems
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
J. Wenny Rahayu, David Taniar
C3S2E
2009
ACM
15 years 7 months ago
The promise of solid state disks: increasing efficiency and reducing cost of DBMS processing
Most database systems (DBMSs) today are operating on servers equipped with magnetic disks. In our contribution, we want to motivate the use of two emerging and striking technologi...
Karsten Schmidt 0002, Yi Ou, Theo Härder
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 4 months ago
Optimizing SQL Queries over Text Databases
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
Alpa Jain, AnHai Doan, Luis Gravano
VLDB
1987
ACM
104views Database» more  VLDB 1987»
15 years 6 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin