Sciweavers

101 search results - page 4 / 21
» Efficient Processing of Nested Fuzzy SQL Queries
Sort
View
IDEAS
2003
IEEE
96views Database» more  IDEAS 2003»
13 years 11 months ago
Evaluating Nested Queries on XML Data
In the past few years, much attention has been paid to the study of semistructured data, i.e., data with irregular, possibly unstable, and rapidly changing structure, and, in part...
Carlo Sartiani
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 7 months ago
SQL Queries Over Unstructured Text Databases
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...
Alpa Jain, AnHai Doan, Luis Gravano
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 6 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
PVLDB
2010
86views more  PVLDB 2010»
13 years 4 months ago
Thirteen New Players in the Team: A Ferry-based LINQ to SQL Provider
We demonstrate an efficient LINQ to SQL provider and its significant impact on the runtime performance of LINQ programs that process large data volumes. This alternative provider...
Tom Schreiber, Simone Bonetti, Torsten Grust, Manu...
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
13 years 10 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...