• No results found

query AND/OR tree

Applying SD-Tree for Object-Oriented query processing

Applying SD-Tree for Object-Oriented query processing

... S- Tree has been further improved in [13, ...improve query response ...S- tree and parametric weighted filter is used to evaluate subset-superset ...

12

SQL Injection Attack and User Behavior Detection by Using Query Tree, Fisher Score and SVM Classification

SQL Injection Attack and User Behavior Detection by Using Query Tree, Fisher Score and SVM Classification

... System is Proposed for the SQL Injection attack detection and user behaviour detection by using query tree. The proposed system is tested with sample dataset having various queries. To reduce the redundant ...

5

Parallel Response Ternary Query Tree for RFID Tag Anti Collision

Parallel Response Ternary Query Tree for RFID Tag Anti Collision

... response query tree scheme that combines the frequency shift keying (FSK) modulation and Manchester coding to provide two subcarriers for tags communicating with reader in ...ternary query ...

8

Bit Shuffling Query Tree Algorithm for Secure Communication in RFID Network

Bit Shuffling Query Tree Algorithm for Secure Communication in RFID Network

... This approach minimizes the threat to RFID system by implementing bit shuffling algorithm to existing Query Tree algorithm. At step 1 each tag shuffles its containing information. When a reader sends a ...

8

A Two way Hybrid Query Tree Anti collision Algorithm

A Two way Hybrid Query Tree Anti collision Algorithm

... The query process of every collision slot time can be demonstrated by a binary tree execute traverse operation and the number of query instruction is 2 node in the ...of query instruction sent ...

8

1.
													Ir-tree query processing in spatial database

1. Ir-tree query processing in spatial database

... in query processing by allowing an efficient merge ...IR- tree, a point retrieved from the index must be verified ...NN query q with keyword set Wq, the query algorithm of I-index first ...

7

Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree

Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree

... Direct query on objects in object-oriented databases costs a large space for data storage during query process and a long time to execute query on real ...during query executing process while ...

7

Tree Based Association Rules for Mining in XML Query -Answering

Tree Based Association Rules for Mining in XML Query -Answering

... storing Tree-Based Association Rules (TARs) as a means to represent intensional knowledge in ...body tree and SH the head tree of the rule and SB is a subtree of ...the tree SB appears in an ...

5

LPath+: A First-Order Complete Language for Linguistic Tree Query

LPath+: A First-Order Complete Language for Linguistic Tree Query

... new query language which augmented the navigational axes of XPath with three additional tree ...linguistic query can be restricted to conditional paths, and supports the argument that first-order ...

12

Title: Answering XML Query Using Tree Based Association Rule

Title: Answering XML Query Using Tree Based Association Rule

... The main goal is to provide a method for mining intensional knowledge from XML datasets by using tree based association rules. The mined TARs are basically used to get a concise idea of structure and the content ...

6

Efficient Query Optimization Of Xml Tree Pattern Matching By Using Holistic Approach

Efficient Query Optimization Of Xml Tree Pattern Matching By Using Holistic Approach

... XML query processing was considered by Timber [15] and Lore DBMS ...XML tree pattern matching can’t solve the problem of ...XML tree pattern matching queries in terms of P-C or A-D relationships or ...

7

Searching in the Penn Discourse Treebank Using the PML Tree Query

Searching in the Penn Discourse Treebank Using the PML Tree Query

... In our approach, we also transform the data of the PTB and the PDTB-2.0 into an XML format (PML, see Section 4.1). Unlike the previous approaches, for searching in the data we offer a powerful, yet user-friendly and ...

8

XML Query Answering using Tree based Association Rules

XML Query Answering using Tree based Association Rules

... keyword query is not easy to determine and can be ambiguous, because the search via condition is not unique; so, how to measure the confidence of each search intention candidate, and rank the individual matches of ...

5

Syntactic Parsing of Web Queries

Syntactic Parsing of Web Queries

... To take context into consideration, which means estimating P(e | x, y, q) for any two tokens x, y ∈ q, we are looking at the problem of building a parser for web queries. This requires a training dataset (a treebank). In ...

10

Optimization of Query Processing Time Base on Materialized Sample View

Optimization of Query Processing Time Base on Materialized Sample View

... ACE Tree supports “fast first” sampling from a range predicate: a large number of samples are returned very ...B+- Tree having a similar structure to the ACE Tree depicted in ...the tree are ...

7

Day 17 - CS6302 - Heuristic Query  optimization.ppt

Day 17 - CS6302 - Heuristic Query optimization.ppt

... nodes of the tree so that the leaf node relations with the most restrictive select operations are executed first in the query tree representation. Using Rule 12, combine a Cartesian pro[r] ...

16

Incremental Information Extraction Using Relational Database System & PTQL

Incremental Information Extraction Using Relational Database System & PTQL

... first query generation approach takes advantage of manually annotated data to generate PTQL queries for the extraction of protein-protein ...the query generator to perform extraction from the parse ...

11

Equal workload distribution tree construction algorithm for  wireless sensor networks

Equal workload distribution tree construction algorithm for wireless sensor networks

... a tree topology for communication. In a WSN, that adopts tree topology, it is observed that the nodes at higher levels of the tree tend to consume more power when compared to those at lower ...

8

APPROACHING NEAREST NEIGHBORS WITH KEYWORDS IN EFFICIENT MANNER

APPROACHING NEAREST NEIGHBORS WITH KEYWORDS IN EFFICIENT MANNER

... Today, the widespread use of search engines has made it realistic to write spatial queries in a brand new way. Conventionally, queries focus on objects’ geometric properties only, such as whether a point is in a ...

8

Comparison of Advance Tree Data Structures

Comparison of Advance Tree Data Structures

... a query and query is process by database system or search engine internally process query on database of different ...of query. For any type of search or retrieval of information we ask a ...

11

Show all 10000 documents...

Related subjects