Sciweavers

365 search results - page 64 / 73
» Answering Non-Monotonic Queries in Relational Data Exchange
Sort
View
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 9 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
VLDB
2004
ACM
137views Database» more  VLDB 2004»
15 years 2 months ago
Schema-Free XQuery
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowle...
Yunyao Li, Cong Yu, H. V. Jagadish
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
COMPLIFE
2005
Springer
15 years 3 months ago
Protein Annotation by Secondary Structure Based Alignments (PASSTA)
Abstract. Most software tools in homology recognition on proteins answer only a few specific questions, often leaving not much room for the interpretation of the results. We devel...
Constantin Bannert, Jens Stoye
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 9 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...